./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_diamond_middle.sol_5_no_adts_000.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:24:18,638 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:24:18,688 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ceaecb-0dba-437e-8a67-a73a0e59b70b/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:24:18,691 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:24:18,691 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:24:18,710 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:24:18,710 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:24:18,710 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:24:18,711 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:24:18,711 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:24:18,711 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:24:18,711 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:24:18,711 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:24:18,712 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:24:18,712 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:24:18,712 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:24:18,712 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:24:18,712 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:24:18,712 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:24:18,712 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:24:18,712 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:24:18,712 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:24:18,713 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:24:18,713 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:24:18,713 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:24:18,713 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:24:18,713 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:24:18,913 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:24:18,918 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:24:18,920 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:24:18,921 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:24:18,921 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:24:18,922 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ceaecb-0dba-437e-8a67-a73a0e59b70b/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_diamond_middle.sol_5_no_adts_000.smt2
[2025-05-07 17:24:18,923 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:24:18,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:24:19,200 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ceaecb-0dba-437e-8a67-a73a0e59b70b/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_diamond_middle.sol_5_no_adts_000.smt2
[2025-05-07 17:24:19,202 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:24:19,203 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:24:19,204 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:24:19,204 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:24:19,204 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:24:19,206 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,240 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19 Unit
[2025-05-07 17:24:19,240 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:24:19,241 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:24:19,241 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:24:19,241 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:24:19,253 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,253 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,278 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,278 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,285 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,286 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,288 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,291 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,292 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,306 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:24:19,306 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:24:19,306 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:24:19,306 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:24:19,307 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (1/1) ...
[2025-05-07 17:24:19,309 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:24:19,319 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:19,330 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:24:19,333 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:24:19,341 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:24:19,341 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:24:19,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:24:19,341 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_8_0 given in one single declaration
[2025-05-07 17:24:19,341 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_8_0
[2025-05-07 17:24:19,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_8_0
[2025-05-07 17:24:19,341 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_13_D_59_0 given in one single declaration
[2025-05-07 17:24:19,342 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_13_D_59_0
[2025-05-07 17:24:19,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_13_D_59_0
[2025-05-07 17:24:19,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_55_C_38_0 given in one single declaration
[2025-05-07 17:24:19,342 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_55_C_38_0
[2025-05-07 17:24:19,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_55_C_38_0
[2025-05-07 17:24:19,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_57_C_38_0 given in one single declaration
[2025-05-07 17:24:19,342 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_57_C_38_0
[2025-05-07 17:24:19,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_57_C_38_0
[2025-05-07 17:24:19,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_56_C_38_0 given in one single declaration
[2025-05-07 17:24:19,342 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_56_C_38_0
[2025-05-07 17:24:19,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_56_C_38_0
[2025-05-07 17:24:19,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_15_constructor_37_59_0 given in one single declaration
[2025-05-07 17:24:19,342 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_15_constructor_37_59_0
[2025-05-07 17:24:19,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_15_constructor_37_59_0
[2025-05-07 17:24:19,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_53_return_constructor_37_59_0 given in one single declaration
[2025-05-07 17:24:19,342 INFO  L130     BoogieDeclarations]: Found specification of procedure block_53_return_constructor_37_59_0
[2025-05-07 17:24:19,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_53_return_constructor_37_59_0
[2025-05-07 17:24:19,343 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_52__36_59_0 given in one single declaration
[2025-05-07 17:24:19,343 INFO  L130     BoogieDeclarations]: Found specification of procedure block_52__36_59_0
[2025-05-07 17:24:19,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_52__36_59_0
[2025-05-07 17:24:19,343 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_51_constructor_37_59_0 given in one single declaration
[2025-05-07 17:24:19,343 INFO  L130     BoogieDeclarations]: Found specification of procedure block_51_constructor_37_59_0
[2025-05-07 17:24:19,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_51_constructor_37_59_0
[2025-05-07 17:24:19,343 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_54_constructor_37_59_0 given in one single declaration
[2025-05-07 17:24:19,343 INFO  L130     BoogieDeclarations]: Found specification of procedure block_54_constructor_37_59_0
[2025-05-07 17:24:19,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_54_constructor_37_59_0
[2025-05-07 17:24:19,343 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_68_D_59_0 given in one single declaration
[2025-05-07 17:24:19,343 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_68_D_59_0
[2025-05-07 17:24:19,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_68_D_59_0
[2025-05-07 17:24:19,343 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_48_D_59_0 given in one single declaration
[2025-05-07 17:24:19,343 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_48_D_59_0
[2025-05-07 17:24:19,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_48_D_59_0
[2025-05-07 17:24:19,343 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_50_D_59_0 given in one single declaration
[2025-05-07 17:24:19,343 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_50_D_59_0
[2025-05-07 17:24:19,344 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_50_D_59_0
[2025-05-07 17:24:19,344 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_49_D_59_0 given in one single declaration
[2025-05-07 17:24:19,344 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_49_D_59_0
[2025-05-07 17:24:19,344 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_49_D_59_0
[2025-05-07 17:24:19,344 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_16_constructor_58_59_0 given in one single declaration
[2025-05-07 17:24:19,344 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_16_constructor_58_59_0
[2025-05-07 17:24:19,344 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_16_constructor_58_59_0
[2025-05-07 17:24:19,344 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_46_constructor_58_59_0 given in one single declaration
[2025-05-07 17:24:19,344 INFO  L130     BoogieDeclarations]: Found specification of procedure block_46_constructor_58_59_0
[2025-05-07 17:24:19,344 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_46_constructor_58_59_0
[2025-05-07 17:24:19,344 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_44__57_59_0 given in one single declaration
[2025-05-07 17:24:19,344 INFO  L130     BoogieDeclarations]: Found specification of procedure block_44__57_59_0
[2025-05-07 17:24:19,344 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_44__57_59_0
[2025-05-07 17:24:19,344 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_43_constructor_58_59_0 given in one single declaration
[2025-05-07 17:24:19,344 INFO  L130     BoogieDeclarations]: Found specification of procedure block_43_constructor_58_59_0
[2025-05-07 17:24:19,344 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_43_constructor_58_59_0
[2025-05-07 17:24:19,344 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_47_constructor_58_59_0 given in one single declaration
[2025-05-07 17:24:19,345 INFO  L130     BoogieDeclarations]: Found specification of procedure block_47_constructor_58_59_0
[2025-05-07 17:24:19,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_47_constructor_58_59_0
[2025-05-07 17:24:19,345 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_45_return_constructor_58_59_0 given in one single declaration
[2025-05-07 17:24:19,345 INFO  L130     BoogieDeclarations]: Found specification of procedure block_45_return_constructor_58_59_0
[2025-05-07 17:24:19,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_45_return_constructor_58_59_0
[2025-05-07 17:24:19,345 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_65_A_4_0 given in one single declaration
[2025-05-07 17:24:19,345 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_65_A_4_0
[2025-05-07 17:24:19,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_65_A_4_0
[2025-05-07 17:24:19,345 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_67_A_4_0 given in one single declaration
[2025-05-07 17:24:19,345 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_67_A_4_0
[2025-05-07 17:24:19,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_67_A_4_0
[2025-05-07 17:24:19,345 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_66_A_4_0 given in one single declaration
[2025-05-07 17:24:19,345 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_66_A_4_0
[2025-05-07 17:24:19,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_66_A_4_0
[2025-05-07 17:24:19,345 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_62_B_21_0 given in one single declaration
[2025-05-07 17:24:19,345 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_62_B_21_0
[2025-05-07 17:24:19,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_62_B_21_0
[2025-05-07 17:24:19,346 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_64_B_21_0 given in one single declaration
[2025-05-07 17:24:19,346 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_64_B_21_0
[2025-05-07 17:24:19,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_64_B_21_0
[2025-05-07 17:24:19,346 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_63_B_21_0 given in one single declaration
[2025-05-07 17:24:19,346 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_63_B_21_0
[2025-05-07 17:24:19,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_63_B_21_0
[2025-05-07 17:24:19,346 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_14_constructor_20_59_0 given in one single declaration
[2025-05-07 17:24:19,346 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_14_constructor_20_59_0
[2025-05-07 17:24:19,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_14_constructor_20_59_0
[2025-05-07 17:24:19,346 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_60_return_constructor_20_59_0 given in one single declaration
[2025-05-07 17:24:19,346 INFO  L130     BoogieDeclarations]: Found specification of procedure block_60_return_constructor_20_59_0
[2025-05-07 17:24:19,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_60_return_constructor_20_59_0
[2025-05-07 17:24:19,346 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_59__19_59_0 given in one single declaration
[2025-05-07 17:24:19,346 INFO  L130     BoogieDeclarations]: Found specification of procedure block_59__19_59_0
[2025-05-07 17:24:19,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_59__19_59_0
[2025-05-07 17:24:19,346 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_58_constructor_20_59_0 given in one single declaration
[2025-05-07 17:24:19,346 INFO  L130     BoogieDeclarations]: Found specification of procedure block_58_constructor_20_59_0
[2025-05-07 17:24:19,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_58_constructor_20_59_0
[2025-05-07 17:24:19,346 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_61_constructor_20_59_0 given in one single declaration
[2025-05-07 17:24:19,346 INFO  L130     BoogieDeclarations]: Found specification of procedure block_61_constructor_20_59_0
[2025-05-07 17:24:19,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_61_constructor_20_59_0
[2025-05-07 17:24:19,346 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_9_C_38_0 given in one single declaration
[2025-05-07 17:24:19,347 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_9_C_38_0
[2025-05-07 17:24:19,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_9_C_38_0
[2025-05-07 17:24:19,347 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_39_A_4_0 given in one single declaration
[2025-05-07 17:24:19,347 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_39_A_4_0
[2025-05-07 17:24:19,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_39_A_4_0
[2025-05-07 17:24:19,347 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_41_A_4_0 given in one single declaration
[2025-05-07 17:24:19,347 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_41_A_4_0
[2025-05-07 17:24:19,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_41_A_4_0
[2025-05-07 17:24:19,347 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_40_A_4_0 given in one single declaration
[2025-05-07 17:24:19,347 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_40_A_4_0
[2025-05-07 17:24:19,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_40_A_4_0
[2025-05-07 17:24:19,347 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_36_C_38_0 given in one single declaration
[2025-05-07 17:24:19,347 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_36_C_38_0
[2025-05-07 17:24:19,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_36_C_38_0
[2025-05-07 17:24:19,347 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_38_C_38_0 given in one single declaration
[2025-05-07 17:24:19,347 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_38_C_38_0
[2025-05-07 17:24:19,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_38_C_38_0
[2025-05-07 17:24:19,347 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_37_C_38_0 given in one single declaration
[2025-05-07 17:24:19,347 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_37_C_38_0
[2025-05-07 17:24:19,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_37_C_38_0
[2025-05-07 17:24:19,347 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_10_constructor_37_38_0 given in one single declaration
[2025-05-07 17:24:19,347 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_10_constructor_37_38_0
[2025-05-07 17:24:19,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_10_constructor_37_38_0
[2025-05-07 17:24:19,348 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_34_return_constructor_37_38_0 given in one single declaration
[2025-05-07 17:24:19,348 INFO  L130     BoogieDeclarations]: Found specification of procedure block_34_return_constructor_37_38_0
[2025-05-07 17:24:19,348 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_34_return_constructor_37_38_0
[2025-05-07 17:24:19,348 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_33__36_38_0 given in one single declaration
[2025-05-07 17:24:19,348 INFO  L130     BoogieDeclarations]: Found specification of procedure block_33__36_38_0
[2025-05-07 17:24:19,348 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_33__36_38_0
[2025-05-07 17:24:19,348 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_constructor_37_38_0 given in one single declaration
[2025-05-07 17:24:19,348 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_constructor_37_38_0
[2025-05-07 17:24:19,348 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_constructor_37_38_0
[2025-05-07 17:24:19,348 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_35_constructor_37_38_0 given in one single declaration
[2025-05-07 17:24:19,348 INFO  L130     BoogieDeclarations]: Found specification of procedure block_35_constructor_37_38_0
[2025-05-07 17:24:19,348 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_35_constructor_37_38_0
[2025-05-07 17:24:19,349 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_42_C_38_0 given in one single declaration
[2025-05-07 17:24:19,349 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_42_C_38_0
[2025-05-07 17:24:19,349 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_42_C_38_0
[2025-05-07 17:24:19,349 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:24:19,349 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:24:19,349 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:24:19,566 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:24:19,568 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:24:19,847 INFO  L?                        ?]: Removed 410 outVars from TransFormulas that were not future-live.
[2025-05-07 17:24:19,847 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:24:19,861 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:24:19,862 INFO  L312             CfgBuilder]: Removed 20 assume(true) statements.
[2025-05-07 17:24:19,862 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:24:19 BoogieIcfgContainer
[2025-05-07 17:24:19,862 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:24:19,864 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:24:19,864 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:24:19,868 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:24:19,868 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:24:19" (1/3) ...
[2025-05-07 17:24:19,869 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b56176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:24:19, skipping insertion in model container
[2025-05-07 17:24:19,869 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:19" (2/3) ...
[2025-05-07 17:24:19,869 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b56176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:24:19, skipping insertion in model container
[2025-05-07 17:24:19,869 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:24:19" (3/3) ...
[2025-05-07 17:24:19,870 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:24:19,885 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:24:19,888 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 46 procedures, 196 locations, 320 edges, 46 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:24:19,926 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:24:19,935 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1945d3f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:24:19,935 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:24:19,938 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 196 states, 77 states have (on average 1.155844155844156) internal successors, (89), 89 states have internal predecessors, (89), 72 states have call successors, (77), 45 states have call predecessors, (77), 45 states have return successors, (77), 61 states have call predecessors, (77), 72 states have call successors, (77)
[2025-05-07 17:24:19,947 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-05-07 17:24:19,947 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:19,948 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:19,948 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:19,952 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:19,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -306069831, now seen corresponding path program 1 times
[2025-05-07 17:24:19,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:19,958 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504482386]
[2025-05-07 17:24:19,958 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:19,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:19,989 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:24:20,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:24:20,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:20,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:20,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:20,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:20,165 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504482386]
[2025-05-07 17:24:20,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504482386] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:20,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:20,168 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:24:20,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072658555]
[2025-05-07 17:24:20,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:20,172 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:24:20,173 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:20,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:24:20,217 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:24:20,220 INFO  L87              Difference]: Start difference. First operand  has 196 states, 77 states have (on average 1.155844155844156) internal successors, (89), 89 states have internal predecessors, (89), 72 states have call successors, (77), 45 states have call predecessors, (77), 45 states have return successors, (77), 61 states have call predecessors, (77), 72 states have call successors, (77) Second operand  has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7)
[2025-05-07 17:24:20,356 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:20,356 INFO  L93              Difference]: Finished difference Result 196 states and 242 transitions.
[2025-05-07 17:24:20,358 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:24:20,360 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 27
[2025-05-07 17:24:20,360 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:20,367 INFO  L225             Difference]: With dead ends: 196
[2025-05-07 17:24:20,367 INFO  L226             Difference]: Without dead ends: 194
[2025-05-07 17:24:20,369 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:24:20,371 INFO  L437           NwaCegarLoop]: 233 mSDtfsCounter, 1 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:20,372 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1138 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:24:20,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2025-05-07 17:24:20,406 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192.
[2025-05-07 17:24:20,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 192 states, 76 states have (on average 1.131578947368421) internal successors, (86), 86 states have internal predecessors, (86), 70 states have call successors, (75), 45 states have call predecessors, (75), 45 states have return successors, (75), 60 states have call predecessors, (75), 70 states have call successors, (75)
[2025-05-07 17:24:20,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 236 transitions.
[2025-05-07 17:24:20,413 INFO  L79                 Accepts]: Start accepts. Automaton has 192 states and 236 transitions. Word has length 27
[2025-05-07 17:24:20,414 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:20,414 INFO  L485      AbstractCegarLoop]: Abstraction has 192 states and 236 transitions.
[2025-05-07 17:24:20,414 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7)
[2025-05-07 17:24:20,414 INFO  L278                IsEmpty]: Start isEmpty. Operand 192 states and 236 transitions.
[2025-05-07 17:24:20,417 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-05-07 17:24:20,417 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:20,417 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:20,417 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:24:20,418 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:20,418 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:20,418 INFO  L85        PathProgramCache]: Analyzing trace with hash -200591420, now seen corresponding path program 1 times
[2025-05-07 17:24:20,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:20,418 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767227252]
[2025-05-07 17:24:20,419 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:20,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:20,438 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:24:20,456 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:24:20,456 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:20,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:20,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:20,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:20,534 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767227252]
[2025-05-07 17:24:20,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767227252] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:20,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:20,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:24:20,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371988460]
[2025-05-07 17:24:20,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:20,535 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:24:20,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:20,535 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:24:20,535 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:24:20,535 INFO  L87              Difference]: Start difference. First operand 192 states and 236 transitions. Second operand  has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-05-07 17:24:20,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:20,594 INFO  L93              Difference]: Finished difference Result 193 states and 235 transitions.
[2025-05-07 17:24:20,594 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:24:20,594 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 27
[2025-05-07 17:24:20,594 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:20,596 INFO  L225             Difference]: With dead ends: 193
[2025-05-07 17:24:20,596 INFO  L226             Difference]: Without dead ends: 192
[2025-05-07 17:24:20,596 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:24:20,596 INFO  L437           NwaCegarLoop]: 230 mSDtfsCounter, 1 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:20,597 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:20,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 192 states.
[2025-05-07 17:24:20,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190.
[2025-05-07 17:24:20,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 190 states, 76 states have (on average 1.118421052631579) internal successors, (85), 85 states have internal predecessors, (85), 68 states have call successors, (73), 45 states have call predecessors, (73), 45 states have return successors, (73), 59 states have call predecessors, (73), 68 states have call successors, (73)
[2025-05-07 17:24:20,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 231 transitions.
[2025-05-07 17:24:20,607 INFO  L79                 Accepts]: Start accepts. Automaton has 190 states and 231 transitions. Word has length 27
[2025-05-07 17:24:20,607 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:20,607 INFO  L485      AbstractCegarLoop]: Abstraction has 190 states and 231 transitions.
[2025-05-07 17:24:20,608 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-05-07 17:24:20,608 INFO  L278                IsEmpty]: Start isEmpty. Operand 190 states and 231 transitions.
[2025-05-07 17:24:20,609 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:24:20,609 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:20,609 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:20,609 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:24:20,609 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:20,609 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:20,610 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961291958, now seen corresponding path program 1 times
[2025-05-07 17:24:20,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:20,610 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160007908]
[2025-05-07 17:24:20,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:20,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:20,626 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:24:20,630 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:24:20,630 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:20,630 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:20,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:20,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:20,687 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160007908]
[2025-05-07 17:24:20,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160007908] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:20,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:20,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:20,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382579554]
[2025-05-07 17:24:20,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:20,688 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:20,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:20,689 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:20,689 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:20,689 INFO  L87              Difference]: Start difference. First operand 190 states and 231 transitions. Second operand  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:24:20,738 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:20,738 INFO  L93              Difference]: Finished difference Result 194 states and 237 transitions.
[2025-05-07 17:24:20,738 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:20,738 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 52
[2025-05-07 17:24:20,739 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:20,740 INFO  L225             Difference]: With dead ends: 194
[2025-05-07 17:24:20,741 INFO  L226             Difference]: Without dead ends: 194
[2025-05-07 17:24:20,741 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:20,742 INFO  L437           NwaCegarLoop]: 231 mSDtfsCounter, 1 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:20,742 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 667 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:20,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2025-05-07 17:24:20,756 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192.
[2025-05-07 17:24:20,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 192 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 86 states have internal predecessors, (86), 68 states have call successors, (73), 45 states have call predecessors, (73), 46 states have return successors, (76), 60 states have call predecessors, (76), 68 states have call successors, (76)
[2025-05-07 17:24:20,759 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 235 transitions.
[2025-05-07 17:24:20,759 INFO  L79                 Accepts]: Start accepts. Automaton has 192 states and 235 transitions. Word has length 52
[2025-05-07 17:24:20,760 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:20,760 INFO  L485      AbstractCegarLoop]: Abstraction has 192 states and 235 transitions.
[2025-05-07 17:24:20,760 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:24:20,760 INFO  L278                IsEmpty]: Start isEmpty. Operand 192 states and 235 transitions.
[2025-05-07 17:24:20,762 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:24:20,762 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:20,762 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:20,762 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:24:20,762 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:20,762 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:20,763 INFO  L85        PathProgramCache]: Analyzing trace with hash -1248691642, now seen corresponding path program 1 times
[2025-05-07 17:24:20,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:20,763 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199955084]
[2025-05-07 17:24:20,763 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:20,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:20,786 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:24:20,805 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:24:20,805 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:20,805 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:21,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:21,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:21,110 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199955084]
[2025-05-07 17:24:21,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199955084] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:21,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:21,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-05-07 17:24:21,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292873653]
[2025-05-07 17:24:21,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:21,111 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:24:21,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:21,111 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:24:21,111 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:24:21,112 INFO  L87              Difference]: Start difference. First operand 192 states and 235 transitions. Second operand  has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 10 states have call predecessors, (14), 6 states have call successors, (14)
[2025-05-07 17:24:21,332 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:21,332 INFO  L93              Difference]: Finished difference Result 204 states and 256 transitions.
[2025-05-07 17:24:21,332 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:24:21,333 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 10 states have call predecessors, (14), 6 states have call successors, (14) Word has length 52
[2025-05-07 17:24:21,333 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:21,334 INFO  L225             Difference]: With dead ends: 204
[2025-05-07 17:24:21,334 INFO  L226             Difference]: Without dead ends: 202
[2025-05-07 17:24:21,335 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:24:21,335 INFO  L437           NwaCegarLoop]: 228 mSDtfsCounter, 3 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:21,335 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2687 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:24:21,336 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2025-05-07 17:24:21,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195.
[2025-05-07 17:24:21,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 195 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 87 states have internal predecessors, (87), 69 states have call successors, (74), 45 states have call predecessors, (74), 47 states have return successors, (79), 62 states have call predecessors, (79), 69 states have call successors, (79)
[2025-05-07 17:24:21,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 240 transitions.
[2025-05-07 17:24:21,343 INFO  L79                 Accepts]: Start accepts. Automaton has 195 states and 240 transitions. Word has length 52
[2025-05-07 17:24:21,343 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:21,343 INFO  L485      AbstractCegarLoop]: Abstraction has 195 states and 240 transitions.
[2025-05-07 17:24:21,344 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 10 states have call predecessors, (14), 6 states have call successors, (14)
[2025-05-07 17:24:21,344 INFO  L278                IsEmpty]: Start isEmpty. Operand 195 states and 240 transitions.
[2025-05-07 17:24:21,345 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:24:21,345 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:21,345 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:21,345 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:24:21,345 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:21,345 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:21,345 INFO  L85        PathProgramCache]: Analyzing trace with hash -1674398960, now seen corresponding path program 1 times
[2025-05-07 17:24:21,345 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:21,345 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257057198]
[2025-05-07 17:24:21,345 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:21,345 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:21,360 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:24:21,369 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:24:21,370 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:21,370 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:21,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:21,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:21,436 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257057198]
[2025-05-07 17:24:21,436 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257057198] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:21,436 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:21,436 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:24:21,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168847578]
[2025-05-07 17:24:21,436 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:21,437 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:24:21,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:21,437 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:24:21,437 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:21,438 INFO  L87              Difference]: Start difference. First operand 195 states and 240 transitions. Second operand  has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14)
[2025-05-07 17:24:21,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:21,513 INFO  L93              Difference]: Finished difference Result 192 states and 232 transitions.
[2025-05-07 17:24:21,513 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:24:21,513 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 52
[2025-05-07 17:24:21,514 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:21,514 INFO  L225             Difference]: With dead ends: 192
[2025-05-07 17:24:21,514 INFO  L226             Difference]: Without dead ends: 191
[2025-05-07 17:24:21,515 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:21,515 INFO  L437           NwaCegarLoop]: 219 mSDtfsCounter, 2 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:21,515 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1293 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:24:21,516 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-05-07 17:24:21,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189.
[2025-05-07 17:24:21,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 77 states have (on average 1.103896103896104) internal successors, (85), 85 states have internal predecessors, (85), 65 states have call successors, (70), 45 states have call predecessors, (70), 46 states have return successors, (71), 58 states have call predecessors, (71), 65 states have call successors, (71)
[2025-05-07 17:24:21,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 226 transitions.
[2025-05-07 17:24:21,522 INFO  L79                 Accepts]: Start accepts. Automaton has 189 states and 226 transitions. Word has length 52
[2025-05-07 17:24:21,522 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:21,522 INFO  L485      AbstractCegarLoop]: Abstraction has 189 states and 226 transitions.
[2025-05-07 17:24:21,523 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14)
[2025-05-07 17:24:21,523 INFO  L278                IsEmpty]: Start isEmpty. Operand 189 states and 226 transitions.
[2025-05-07 17:24:21,523 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:24:21,524 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:21,524 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:21,524 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:24:21,524 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:21,524 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:21,524 INFO  L85        PathProgramCache]: Analyzing trace with hash 488458338, now seen corresponding path program 1 times
[2025-05-07 17:24:21,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:21,524 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960248180]
[2025-05-07 17:24:21,524 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:21,524 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:21,539 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:24:21,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:24:21,541 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:21,541 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:21,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:21,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:21,587 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960248180]
[2025-05-07 17:24:21,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960248180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:21,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:21,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:21,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879985617]
[2025-05-07 17:24:21,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:21,588 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:21,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:21,588 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:21,589 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:21,589 INFO  L87              Difference]: Start difference. First operand 189 states and 226 transitions. Second operand  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:24:21,598 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:21,598 INFO  L93              Difference]: Finished difference Result 191 states and 227 transitions.
[2025-05-07 17:24:21,598 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:21,599 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 52
[2025-05-07 17:24:21,599 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:21,599 INFO  L225             Difference]: With dead ends: 191
[2025-05-07 17:24:21,600 INFO  L226             Difference]: Without dead ends: 186
[2025-05-07 17:24:21,600 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:21,600 INFO  L437           NwaCegarLoop]: 224 mSDtfsCounter, 1 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:21,600 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 661 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:21,601 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2025-05-07 17:24:21,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186.
[2025-05-07 17:24:21,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 186 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 84 states have internal predecessors, (84), 62 states have call successors, (67), 45 states have call predecessors, (67), 46 states have return successors, (68), 56 states have call predecessors, (68), 62 states have call successors, (68)
[2025-05-07 17:24:21,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 219 transitions.
[2025-05-07 17:24:21,606 INFO  L79                 Accepts]: Start accepts. Automaton has 186 states and 219 transitions. Word has length 52
[2025-05-07 17:24:21,606 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:21,606 INFO  L485      AbstractCegarLoop]: Abstraction has 186 states and 219 transitions.
[2025-05-07 17:24:21,606 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:24:21,606 INFO  L278                IsEmpty]: Start isEmpty. Operand 186 states and 219 transitions.
[2025-05-07 17:24:21,607 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:24:21,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:21,607 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:21,607 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:24:21,607 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:21,608 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:21,608 INFO  L85        PathProgramCache]: Analyzing trace with hash 896667749, now seen corresponding path program 1 times
[2025-05-07 17:24:21,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:21,608 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583201772]
[2025-05-07 17:24:21,608 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:21,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:21,627 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:24:21,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:24:21,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:21,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:21,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:21,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:21,674 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583201772]
[2025-05-07 17:24:21,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583201772] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:21,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:21,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:21,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112764457]
[2025-05-07 17:24:21,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:21,675 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:21,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:21,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:21,675 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:21,675 INFO  L87              Difference]: Start difference. First operand 186 states and 219 transitions. Second operand  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:24:21,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:21,688 INFO  L93              Difference]: Finished difference Result 188 states and 220 transitions.
[2025-05-07 17:24:21,689 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:21,689 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 52
[2025-05-07 17:24:21,689 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:21,690 INFO  L225             Difference]: With dead ends: 188
[2025-05-07 17:24:21,690 INFO  L226             Difference]: Without dead ends: 184
[2025-05-07 17:24:21,690 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:21,691 INFO  L437           NwaCegarLoop]: 216 mSDtfsCounter, 1 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:21,691 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 637 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:21,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2025-05-07 17:24:21,696 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184.
[2025-05-07 17:24:21,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 184 states, 77 states have (on average 1.077922077922078) internal successors, (83), 83 states have internal predecessors, (83), 60 states have call successors, (65), 45 states have call predecessors, (65), 46 states have return successors, (66), 55 states have call predecessors, (66), 60 states have call successors, (66)
[2025-05-07 17:24:21,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions.
[2025-05-07 17:24:21,698 INFO  L79                 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 52
[2025-05-07 17:24:21,698 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:21,698 INFO  L485      AbstractCegarLoop]: Abstraction has 184 states and 214 transitions.
[2025-05-07 17:24:21,698 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:24:21,699 INFO  L278                IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions.
[2025-05-07 17:24:21,699 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:24:21,699 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:21,699 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:21,699 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:24:21,699 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:21,700 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:21,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 1618200425, now seen corresponding path program 1 times
[2025-05-07 17:24:21,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:21,700 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316651828]
[2025-05-07 17:24:21,700 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:21,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:21,715 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:24:21,723 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:24:21,723 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:21,723 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:21,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:21,790 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:21,790 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316651828]
[2025-05-07 17:24:21,790 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316651828] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:21,791 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:21,791 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:24:21,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337971592]
[2025-05-07 17:24:21,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:21,791 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:24:21,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:21,792 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:24:21,792 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:21,792 INFO  L87              Difference]: Start difference. First operand 184 states and 214 transitions. Second operand  has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14)
[2025-05-07 17:24:21,841 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:21,841 INFO  L93              Difference]: Finished difference Result 186 states and 215 transitions.
[2025-05-07 17:24:21,841 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:24:21,842 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 52
[2025-05-07 17:24:21,842 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:21,843 INFO  L225             Difference]: With dead ends: 186
[2025-05-07 17:24:21,843 INFO  L226             Difference]: Without dead ends: 180
[2025-05-07 17:24:21,843 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:21,844 INFO  L437           NwaCegarLoop]: 208 mSDtfsCounter, 2 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:21,844 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1231 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:21,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2025-05-07 17:24:21,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180.
[2025-05-07 17:24:21,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 180 states, 75 states have (on average 1.08) internal successors, (81), 81 states have internal predecessors, (81), 59 states have call successors, (63), 44 states have call predecessors, (63), 45 states have return successors, (64), 54 states have call predecessors, (64), 59 states have call successors, (64)
[2025-05-07 17:24:21,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions.
[2025-05-07 17:24:21,851 INFO  L79                 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 52
[2025-05-07 17:24:21,852 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:21,852 INFO  L485      AbstractCegarLoop]: Abstraction has 180 states and 208 transitions.
[2025-05-07 17:24:21,852 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14)
[2025-05-07 17:24:21,852 INFO  L278                IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions.
[2025-05-07 17:24:21,853 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:24:21,853 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:21,853 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:21,853 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:24:21,853 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:21,854 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:21,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -2037869513, now seen corresponding path program 1 times
[2025-05-07 17:24:21,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:21,854 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096494868]
[2025-05-07 17:24:21,854 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:21,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:21,873 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:24:21,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:24:21,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:21,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:22,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:22,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:22,119 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096494868]
[2025-05-07 17:24:22,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096494868] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:22,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:22,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-05-07 17:24:22,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548669562]
[2025-05-07 17:24:22,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:22,120 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:24:22,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:22,121 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:24:22,121 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:24:22,121 INFO  L87              Difference]: Start difference. First operand 180 states and 208 transitions. Second operand  has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14)
[2025-05-07 17:24:22,213 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:22,213 INFO  L93              Difference]: Finished difference Result 178 states and 205 transitions.
[2025-05-07 17:24:22,213 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:24:22,213 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) Word has length 52
[2025-05-07 17:24:22,214 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:22,214 INFO  L225             Difference]: With dead ends: 178
[2025-05-07 17:24:22,214 INFO  L226             Difference]: Without dead ends: 136
[2025-05-07 17:24:22,215 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:24:22,215 INFO  L437           NwaCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:22,215 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2327 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:24:22,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2025-05-07 17:24:22,218 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136.
[2025-05-07 17:24:22,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 60 states have internal predecessors, (60), 47 states have call successors, (51), 32 states have call predecessors, (51), 33 states have return successors, (52), 43 states have call predecessors, (52), 47 states have call successors, (52)
[2025-05-07 17:24:22,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 163 transitions.
[2025-05-07 17:24:22,219 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 163 transitions. Word has length 52
[2025-05-07 17:24:22,220 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:22,220 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 163 transitions.
[2025-05-07 17:24:22,220 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14)
[2025-05-07 17:24:22,220 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 163 transitions.
[2025-05-07 17:24:22,220 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:24:22,220 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:22,221 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:22,221 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:24:22,221 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:22,221 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:22,221 INFO  L85        PathProgramCache]: Analyzing trace with hash 202050979, now seen corresponding path program 1 times
[2025-05-07 17:24:22,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:22,221 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717727736]
[2025-05-07 17:24:22,221 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:22,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:22,244 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:24:22,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:24:22,247 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:22,247 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:22,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:22,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:22,297 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717727736]
[2025-05-07 17:24:22,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717727736] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:22,297 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:22,297 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:22,297 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385140213]
[2025-05-07 17:24:22,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:22,298 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:22,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:22,298 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:22,298 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:22,298 INFO  L87              Difference]: Start difference. First operand 136 states and 163 transitions. Second operand  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:24:22,325 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:22,325 INFO  L93              Difference]: Finished difference Result 140 states and 168 transitions.
[2025-05-07 17:24:22,326 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:22,326 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 77
[2025-05-07 17:24:22,326 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:22,327 INFO  L225             Difference]: With dead ends: 140
[2025-05-07 17:24:22,327 INFO  L226             Difference]: Without dead ends: 140
[2025-05-07 17:24:22,327 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:22,327 INFO  L437           NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:22,328 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 457 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:22,328 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2025-05-07 17:24:22,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138.
[2025-05-07 17:24:22,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 138 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 61 states have internal predecessors, (61), 47 states have call successors, (51), 32 states have call predecessors, (51), 34 states have return successors, (54), 44 states have call predecessors, (54), 47 states have call successors, (54)
[2025-05-07 17:24:22,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions.
[2025-05-07 17:24:22,332 INFO  L79                 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 77
[2025-05-07 17:24:22,332 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:22,332 INFO  L485      AbstractCegarLoop]: Abstraction has 138 states and 166 transitions.
[2025-05-07 17:24:22,332 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:24:22,332 INFO  L278                IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions.
[2025-05-07 17:24:22,333 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:24:22,333 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:22,333 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:22,333 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:24:22,333 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:22,334 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:22,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -1584670731, now seen corresponding path program 1 times
[2025-05-07 17:24:22,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:22,334 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960192169]
[2025-05-07 17:24:22,334 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:22,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:22,360 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:24:22,370 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:24:22,370 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:22,370 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:22,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:22,429 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:22,430 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960192169]
[2025-05-07 17:24:22,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960192169] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:22,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:22,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:22,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639080325]
[2025-05-07 17:24:22,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:22,430 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:22,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:22,431 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:22,431 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:22,431 INFO  L87              Difference]: Start difference. First operand 138 states and 166 transitions. Second operand  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:24:22,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:22,453 INFO  L93              Difference]: Finished difference Result 140 states and 169 transitions.
[2025-05-07 17:24:22,453 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:22,454 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 77
[2025-05-07 17:24:22,454 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:22,455 INFO  L225             Difference]: With dead ends: 140
[2025-05-07 17:24:22,455 INFO  L226             Difference]: Without dead ends: 140
[2025-05-07 17:24:22,455 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:22,455 INFO  L437           NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:22,456 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 454 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:22,456 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2025-05-07 17:24:22,460 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140.
[2025-05-07 17:24:22,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 140 states, 57 states have (on average 1.087719298245614) internal successors, (62), 62 states have internal predecessors, (62), 47 states have call successors, (51), 32 states have call predecessors, (51), 35 states have return successors, (56), 45 states have call predecessors, (56), 47 states have call successors, (56)
[2025-05-07 17:24:22,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions.
[2025-05-07 17:24:22,462 INFO  L79                 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 77
[2025-05-07 17:24:22,462 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:22,462 INFO  L485      AbstractCegarLoop]: Abstraction has 140 states and 169 transitions.
[2025-05-07 17:24:22,462 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:24:22,462 INFO  L278                IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions.
[2025-05-07 17:24:22,463 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:24:22,463 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:22,463 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:22,463 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:24:22,463 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:22,463 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:22,463 INFO  L85        PathProgramCache]: Analyzing trace with hash -1982841487, now seen corresponding path program 1 times
[2025-05-07 17:24:22,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:22,464 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662574558]
[2025-05-07 17:24:22,464 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:22,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:22,490 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:24:22,506 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:24:22,506 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:22,506 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:22,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:22,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:22,979 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662574558]
[2025-05-07 17:24:22,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662574558] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:22,979 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:22,979 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2025-05-07 17:24:22,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433839569]
[2025-05-07 17:24:22,980 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:22,980 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-05-07 17:24:22,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:22,981 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-05-07 17:24:22,981 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:24:22,981 INFO  L87              Difference]: Start difference. First operand 140 states and 169 transitions. Second operand  has 21 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 10 states have call successors, (21), 1 states have call predecessors, (21), 16 states have return successors, (21), 17 states have call predecessors, (21), 10 states have call successors, (21)
[2025-05-07 17:24:23,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:23,410 INFO  L93              Difference]: Finished difference Result 156 states and 197 transitions.
[2025-05-07 17:24:23,410 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-05-07 17:24:23,410 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 10 states have call successors, (21), 1 states have call predecessors, (21), 16 states have return successors, (21), 17 states have call predecessors, (21), 10 states have call successors, (21) Word has length 77
[2025-05-07 17:24:23,411 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:23,412 INFO  L225             Difference]: With dead ends: 156
[2025-05-07 17:24:23,412 INFO  L226             Difference]: Without dead ends: 156
[2025-05-07 17:24:23,412 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600
[2025-05-07 17:24:23,413 INFO  L437           NwaCegarLoop]: 142 mSDtfsCounter, 5 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:23,413 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2785 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:24:23,413 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2025-05-07 17:24:23,420 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150.
[2025-05-07 17:24:23,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 150 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 65 states have internal predecessors, (65), 51 states have call successors, (55), 32 states have call predecessors, (55), 38 states have return successors, (68), 52 states have call predecessors, (68), 51 states have call successors, (68)
[2025-05-07 17:24:23,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions.
[2025-05-07 17:24:23,422 INFO  L79                 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 77
[2025-05-07 17:24:23,422 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:23,422 INFO  L485      AbstractCegarLoop]: Abstraction has 150 states and 188 transitions.
[2025-05-07 17:24:23,422 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 10 states have call successors, (21), 1 states have call predecessors, (21), 16 states have return successors, (21), 17 states have call predecessors, (21), 10 states have call successors, (21)
[2025-05-07 17:24:23,422 INFO  L278                IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions.
[2025-05-07 17:24:23,423 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:24:23,423 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:23,423 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:23,424 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:24:23,424 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:23,424 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:23,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -967849317, now seen corresponding path program 1 times
[2025-05-07 17:24:23,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:23,424 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283871277]
[2025-05-07 17:24:23,424 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:23,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:23,450 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:24:23,462 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:24:23,462 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:23,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:23,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:23,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:23,657 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283871277]
[2025-05-07 17:24:23,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283871277] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:23,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:23,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-05-07 17:24:23,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996968631]
[2025-05-07 17:24:23,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:23,658 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:24:23,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:23,658 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:24:23,658 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:24:23,659 INFO  L87              Difference]: Start difference. First operand 150 states and 188 transitions. Second operand  has 13 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (21), 11 states have call predecessors, (21), 7 states have call successors, (21)
[2025-05-07 17:24:23,824 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:23,824 INFO  L93              Difference]: Finished difference Result 152 states and 189 transitions.
[2025-05-07 17:24:23,824 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:24:23,825 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (21), 11 states have call predecessors, (21), 7 states have call successors, (21) Word has length 77
[2025-05-07 17:24:23,825 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:23,826 INFO  L225             Difference]: With dead ends: 152
[2025-05-07 17:24:23,826 INFO  L226             Difference]: Without dead ends: 152
[2025-05-07 17:24:23,826 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:24:23,827 INFO  L437           NwaCegarLoop]: 155 mSDtfsCounter, 3 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:23,827 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1824 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:24:23,827 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2025-05-07 17:24:23,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 141.
[2025-05-07 17:24:23,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 141 states, 57 states have (on average 1.087719298245614) internal successors, (62), 62 states have internal predecessors, (62), 48 states have call successors, (52), 32 states have call predecessors, (52), 35 states have return successors, (57), 46 states have call predecessors, (57), 48 states have call successors, (57)
[2025-05-07 17:24:23,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions.
[2025-05-07 17:24:23,834 INFO  L79                 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 77
[2025-05-07 17:24:23,834 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:23,834 INFO  L485      AbstractCegarLoop]: Abstraction has 141 states and 171 transitions.
[2025-05-07 17:24:23,834 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (21), 11 states have call predecessors, (21), 7 states have call successors, (21)
[2025-05-07 17:24:23,834 INFO  L278                IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions.
[2025-05-07 17:24:23,835 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:24:23,835 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:23,836 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:23,836 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:24:23,836 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:23,836 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:23,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -1713660185, now seen corresponding path program 1 times
[2025-05-07 17:24:23,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:23,836 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386117597]
[2025-05-07 17:24:23,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:23,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:23,855 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:24:23,864 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:24:23,864 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:23,864 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:23,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:23,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:23,937 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386117597]
[2025-05-07 17:24:23,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386117597] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:23,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:23,937 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:24:23,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190194430]
[2025-05-07 17:24:23,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:23,938 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:24:23,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:23,938 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:24:23,939 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:23,939 INFO  L87              Difference]: Start difference. First operand 141 states and 171 transitions. Second operand  has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (21), 1 states have call predecessors, (21), 6 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21)
[2025-05-07 17:24:23,992 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:23,992 INFO  L93              Difference]: Finished difference Result 154 states and 192 transitions.
[2025-05-07 17:24:23,993 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:24:23,993 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (21), 1 states have call predecessors, (21), 6 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) Word has length 77
[2025-05-07 17:24:23,993 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:23,994 INFO  L225             Difference]: With dead ends: 154
[2025-05-07 17:24:23,994 INFO  L226             Difference]: Without dead ends: 149
[2025-05-07 17:24:23,994 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:23,994 INFO  L437           NwaCegarLoop]: 164 mSDtfsCounter, 1 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:23,995 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 964 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:23,995 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2025-05-07 17:24:23,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144.
[2025-05-07 17:24:23,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 63 states have internal predecessors, (63), 49 states have call successors, (53), 32 states have call predecessors, (53), 36 states have return successors, (60), 48 states have call predecessors, (60), 49 states have call successors, (60)
[2025-05-07 17:24:23,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions.
[2025-05-07 17:24:23,998 INFO  L79                 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 77
[2025-05-07 17:24:23,999 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:23,999 INFO  L485      AbstractCegarLoop]: Abstraction has 144 states and 176 transitions.
[2025-05-07 17:24:23,999 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (21), 1 states have call predecessors, (21), 6 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21)
[2025-05-07 17:24:23,999 INFO  L278                IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions.
[2025-05-07 17:24:23,999 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:24:23,999 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:23,999 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:23,999 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:24:24,000 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:24,000 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:24,000 INFO  L85        PathProgramCache]: Analyzing trace with hash -698668015, now seen corresponding path program 1 times
[2025-05-07 17:24:24,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:24,000 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803346604]
[2025-05-07 17:24:24,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:24,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:24,022 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:24:24,030 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:24:24,030 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:24,030 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:24,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:24,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:24,098 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803346604]
[2025-05-07 17:24:24,098 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803346604] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:24,098 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:24,098 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:24:24,098 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915011450]
[2025-05-07 17:24:24,098 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:24,099 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:24:24,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:24,099 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:24:24,099 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:24,099 INFO  L87              Difference]: Start difference. First operand 144 states and 176 transitions. Second operand  has 7 states, 5 states have (on average 7.0) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21)
[2025-05-07 17:24:24,157 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:24,157 INFO  L93              Difference]: Finished difference Result 140 states and 166 transitions.
[2025-05-07 17:24:24,157 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:24:24,157 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 7.0) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 77
[2025-05-07 17:24:24,157 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:24,158 INFO  L225             Difference]: With dead ends: 140
[2025-05-07 17:24:24,158 INFO  L226             Difference]: Without dead ends: 139
[2025-05-07 17:24:24,158 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:24,159 INFO  L437           NwaCegarLoop]: 151 mSDtfsCounter, 2 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:24,159 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 885 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:24,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2025-05-07 17:24:24,164 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134.
[2025-05-07 17:24:24,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 60 states have internal predecessors, (60), 43 states have call successors, (47), 32 states have call predecessors, (47), 34 states have return successors, (49), 41 states have call predecessors, (49), 43 states have call successors, (49)
[2025-05-07 17:24:24,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions.
[2025-05-07 17:24:24,165 INFO  L79                 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 77
[2025-05-07 17:24:24,165 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:24,165 INFO  L485      AbstractCegarLoop]: Abstraction has 134 states and 156 transitions.
[2025-05-07 17:24:24,165 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 7.0) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21)
[2025-05-07 17:24:24,166 INFO  L278                IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions.
[2025-05-07 17:24:24,167 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:24:24,167 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:24,167 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:24,167 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:24:24,167 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:24,167 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:24,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -1532786931, now seen corresponding path program 1 times
[2025-05-07 17:24:24,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:24,168 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676000070]
[2025-05-07 17:24:24,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:24,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:24,200 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:24:24,207 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:24:24,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:24,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:24,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:24,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:24,466 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676000070]
[2025-05-07 17:24:24,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676000070] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:24,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:24,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-05-07 17:24:24,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711232566]
[2025-05-07 17:24:24,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:24,467 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:24:24,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:24,467 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:24:24,467 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:24:24,468 INFO  L87              Difference]: Start difference. First operand 134 states and 156 transitions. Second operand  has 13 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (28), 11 states have call predecessors, (28), 7 states have call successors, (28)
[2025-05-07 17:24:24,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:24,624 INFO  L93              Difference]: Finished difference Result 139 states and 163 transitions.
[2025-05-07 17:24:24,624 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:24:24,624 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (28), 11 states have call predecessors, (28), 7 states have call successors, (28) Word has length 102
[2025-05-07 17:24:24,625 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:24,625 INFO  L225             Difference]: With dead ends: 139
[2025-05-07 17:24:24,625 INFO  L226             Difference]: Without dead ends: 126
[2025-05-07 17:24:24,625 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:24:24,626 INFO  L437           NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:24,626 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1698 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:24:24,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2025-05-07 17:24:24,628 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126.
[2025-05-07 17:24:24,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 126 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 56 states have internal predecessors, (56), 40 states have call successors, (43), 31 states have call predecessors, (43), 32 states have return successors, (44), 38 states have call predecessors, (44), 40 states have call successors, (44)
[2025-05-07 17:24:24,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions.
[2025-05-07 17:24:24,629 INFO  L79                 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 102
[2025-05-07 17:24:24,629 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:24,629 INFO  L485      AbstractCegarLoop]: Abstraction has 126 states and 143 transitions.
[2025-05-07 17:24:24,629 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (28), 11 states have call predecessors, (28), 7 states have call successors, (28)
[2025-05-07 17:24:24,629 INFO  L278                IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions.
[2025-05-07 17:24:24,630 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:24:24,630 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:24,630 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:24,630 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:24:24,630 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:24,630 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:24,630 INFO  L85        PathProgramCache]: Analyzing trace with hash 1698206671, now seen corresponding path program 1 times
[2025-05-07 17:24:24,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:24,630 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967947635]
[2025-05-07 17:24:24,630 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:24,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:24,652 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:24:24,660 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:24:24,660 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:24,660 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:24,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:24,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:24,701 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967947635]
[2025-05-07 17:24:24,701 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967947635] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:24,701 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:24,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:24,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185171072]
[2025-05-07 17:24:24,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:24,702 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:24,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:24,702 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:24,702 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:24,702 INFO  L87              Difference]: Start difference. First operand 126 states and 143 transitions. Second operand  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:24:24,719 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:24,720 INFO  L93              Difference]: Finished difference Result 130 states and 147 transitions.
[2025-05-07 17:24:24,720 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:24,720 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 102
[2025-05-07 17:24:24,720 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:24,721 INFO  L225             Difference]: With dead ends: 130
[2025-05-07 17:24:24,721 INFO  L226             Difference]: Without dead ends: 130
[2025-05-07 17:24:24,721 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:24,722 INFO  L437           NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:24,722 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:24,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2025-05-07 17:24:24,726 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128.
[2025-05-07 17:24:24,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 128 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 57 states have internal predecessors, (57), 40 states have call successors, (43), 31 states have call predecessors, (43), 33 states have return successors, (45), 39 states have call predecessors, (45), 40 states have call successors, (45)
[2025-05-07 17:24:24,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions.
[2025-05-07 17:24:24,727 INFO  L79                 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 102
[2025-05-07 17:24:24,727 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:24,727 INFO  L485      AbstractCegarLoop]: Abstraction has 128 states and 145 transitions.
[2025-05-07 17:24:24,727 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:24:24,728 INFO  L278                IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions.
[2025-05-07 17:24:24,728 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:24:24,729 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:24,729 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:24,729 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-05-07 17:24:24,729 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:24,729 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:24,729 INFO  L85        PathProgramCache]: Analyzing trace with hash 38707339, now seen corresponding path program 1 times
[2025-05-07 17:24:24,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:24,729 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307534365]
[2025-05-07 17:24:24,730 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:24,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:24,762 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:24:24,765 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:24:24,765 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:24,765 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:24,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:24,810 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:24,810 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307534365]
[2025-05-07 17:24:24,810 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307534365] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:24,810 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:24,810 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:24,810 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596612735]
[2025-05-07 17:24:24,811 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:24,811 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:24,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:24,811 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:24,811 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:24,812 INFO  L87              Difference]: Start difference. First operand 128 states and 145 transitions. Second operand  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28)
[2025-05-07 17:24:24,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:24,817 INFO  L93              Difference]: Finished difference Result 130 states and 146 transitions.
[2025-05-07 17:24:24,817 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:24,818 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 102
[2025-05-07 17:24:24,818 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:24,818 INFO  L225             Difference]: With dead ends: 130
[2025-05-07 17:24:24,818 INFO  L226             Difference]: Without dead ends: 119
[2025-05-07 17:24:24,818 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:24,819 INFO  L437           NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:24,819 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 412 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:24,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-05-07 17:24:24,821 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2025-05-07 17:24:24,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 54 states have internal predecessors, (54), 33 states have call successors, (36), 31 states have call predecessors, (36), 32 states have return successors, (37), 33 states have call predecessors, (37), 33 states have call successors, (37)
[2025-05-07 17:24:24,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions.
[2025-05-07 17:24:24,821 INFO  L79                 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 102
[2025-05-07 17:24:24,821 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:24,821 INFO  L485      AbstractCegarLoop]: Abstraction has 119 states and 127 transitions.
[2025-05-07 17:24:24,821 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28)
[2025-05-07 17:24:24,822 INFO  L278                IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions.
[2025-05-07 17:24:24,822 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:24:24,822 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:24,822 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:24,822 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-05-07 17:24:24,822 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:24,822 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:24,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -227272163, now seen corresponding path program 1 times
[2025-05-07 17:24:24,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:24,823 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564292742]
[2025-05-07 17:24:24,823 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:24,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:24,850 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:24:24,858 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:24:24,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:24,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:24,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:24,899 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:24,899 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564292742]
[2025-05-07 17:24:24,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564292742] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:24,899 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:24,899 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:24,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703082188]
[2025-05-07 17:24:24,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:24,900 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:24,900 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:24,900 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:24,900 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:24,900 INFO  L87              Difference]: Start difference. First operand 119 states and 127 transitions. Second operand  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28)
[2025-05-07 17:24:24,905 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:24,905 INFO  L93              Difference]: Finished difference Result 121 states and 128 transitions.
[2025-05-07 17:24:24,906 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:24,906 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 102
[2025-05-07 17:24:24,906 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:24,906 INFO  L225             Difference]: With dead ends: 121
[2025-05-07 17:24:24,906 INFO  L226             Difference]: Without dead ends: 117
[2025-05-07 17:24:24,907 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:24,907 INFO  L437           NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:24,907 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:24,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-05-07 17:24:24,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115.
[2025-05-07 17:24:24,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 115 states, 52 states have (on average 1.0) internal successors, (52), 52 states have internal predecessors, (52), 31 states have call successors, (34), 31 states have call predecessors, (34), 31 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34)
[2025-05-07 17:24:24,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions.
[2025-05-07 17:24:24,909 INFO  L79                 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 102
[2025-05-07 17:24:24,910 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:24,910 INFO  L485      AbstractCegarLoop]: Abstraction has 115 states and 120 transitions.
[2025-05-07 17:24:24,910 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28)
[2025-05-07 17:24:24,910 INFO  L278                IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions.
[2025-05-07 17:24:24,910 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:24:24,910 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:24,910 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:24,911 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:24:24,911 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:24,911 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:24,911 INFO  L85        PathProgramCache]: Analyzing trace with hash -943770641, now seen corresponding path program 1 times
[2025-05-07 17:24:24,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:24,911 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109506511]
[2025-05-07 17:24:24,911 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:24,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:24,940 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:24:24,950 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:24:24,950 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:24,950 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:25,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:25,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:25,036 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109506511]
[2025-05-07 17:24:25,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109506511] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:25,036 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:25,037 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:24:25,037 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254108417]
[2025-05-07 17:24:25,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:25,037 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:24:25,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:25,038 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:24:25,038 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:25,038 INFO  L87              Difference]: Start difference. First operand 115 states and 120 transitions. Second operand  has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:24:25,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:25,079 INFO  L93              Difference]: Finished difference Result 117 states and 121 transitions.
[2025-05-07 17:24:25,080 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:24:25,080 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) Word has length 102
[2025-05-07 17:24:25,080 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:25,080 INFO  L225             Difference]: With dead ends: 117
[2025-05-07 17:24:25,080 INFO  L226             Difference]: Without dead ends: 111
[2025-05-07 17:24:25,081 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:25,081 INFO  L437           NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:25,081 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 677 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:25,081 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2025-05-07 17:24:25,083 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111.
[2025-05-07 17:24:25,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 111 states, 50 states have (on average 1.0) internal successors, (50), 50 states have internal predecessors, (50), 30 states have call successors, (32), 30 states have call predecessors, (32), 30 states have return successors, (32), 30 states have call predecessors, (32), 30 states have call successors, (32)
[2025-05-07 17:24:25,083 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions.
[2025-05-07 17:24:25,083 INFO  L79                 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 102
[2025-05-07 17:24:25,083 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:25,083 INFO  L485      AbstractCegarLoop]: Abstraction has 111 states and 114 transitions.
[2025-05-07 17:24:25,084 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:24:25,084 INFO  L278                IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions.
[2025-05-07 17:24:25,084 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:24:25,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:25,084 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:25,084 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:24:25,084 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:25,085 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:25,085 INFO  L85        PathProgramCache]: Analyzing trace with hash 34182817, now seen corresponding path program 1 times
[2025-05-07 17:24:25,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:25,085 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902202947]
[2025-05-07 17:24:25,085 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:25,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:25,107 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:24:25,116 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:24:25,116 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:25,116 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:25,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:25,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:25,191 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902202947]
[2025-05-07 17:24:25,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902202947] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:25,191 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:25,191 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:24:25,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765777539]
[2025-05-07 17:24:25,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:25,191 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:24:25,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:25,192 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:24:25,192 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:25,192 INFO  L87              Difference]: Start difference. First operand 111 states and 114 transitions. Second operand  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:24:25,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:25,220 INFO  L93              Difference]: Finished difference Result 120 states and 125 transitions.
[2025-05-07 17:24:25,220 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:24:25,220 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28) Word has length 102
[2025-05-07 17:24:25,220 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:25,221 INFO  L225             Difference]: With dead ends: 120
[2025-05-07 17:24:25,221 INFO  L226             Difference]: Without dead ends: 107
[2025-05-07 17:24:25,221 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:25,221 INFO  L437           NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:25,221 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 698 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:25,222 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2025-05-07 17:24:25,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2025-05-07 17:24:25,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 48 states have (on average 1.0) internal successors, (48), 48 states have internal predecessors, (48), 29 states have call successors, (30), 29 states have call predecessors, (30), 29 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30)
[2025-05-07 17:24:25,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions.
[2025-05-07 17:24:25,224 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102
[2025-05-07 17:24:25,224 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:25,224 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 108 transitions.
[2025-05-07 17:24:25,224 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:24:25,224 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions.
[2025-05-07 17:24:25,225 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:24:25,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:25,225 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:25,225 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-05-07 17:24:25,225 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:25,225 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:25,225 INFO  L85        PathProgramCache]: Analyzing trace with hash 17052933, now seen corresponding path program 1 times
[2025-05-07 17:24:25,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:25,225 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125869763]
[2025-05-07 17:24:25,225 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:25,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:25,253 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:24:25,263 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:24:25,263 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:25,263 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:25,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:24:25,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:25,344 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125869763]
[2025-05-07 17:24:25,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125869763] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:25,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:25,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:24:25,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028348127]
[2025-05-07 17:24:25,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:25,345 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:24:25,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:25,345 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:24:25,345 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:25,345 INFO  L87              Difference]: Start difference. First operand 107 states and 108 transitions. Second operand  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:24:25,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:25,371 INFO  L93              Difference]: Finished difference Result 101 states and 102 transitions.
[2025-05-07 17:24:25,371 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:24:25,371 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28) Word has length 102
[2025-05-07 17:24:25,371 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:25,371 INFO  L225             Difference]: With dead ends: 101
[2025-05-07 17:24:25,371 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:24:25,372 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:24:25,373 INFO  L437           NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:25,373 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:25,373 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:24:25,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:24:25,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:24:25,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:24:25,373 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102
[2025-05-07 17:24:25,373 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:25,373 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:24:25,373 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:24:25,373 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:24:25,374 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:24:25,375 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:24:25,376 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-05-07 17:24:25,378 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:25,380 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:24:25,382 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:24:25 BoogieIcfgContainer
[2025-05-07 17:24:25,382 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:24:25,382 INFO  L158              Benchmark]: Toolchain (without parser) took 6179.30ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 137.5MB in the beginning and 230.7MB in the end (delta: -93.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:24:25,382 INFO  L158              Benchmark]: SmtParser took 0.19ms. Allocated memory is still 234.9MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:24:25,382 INFO  L158              Benchmark]: ChcToBoogie took 36.94ms. Allocated memory is still 234.9MB. Free memory was 137.5MB in the beginning and 133.5MB in the end (delta: 4.0MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:24:25,383 INFO  L158              Benchmark]: Boogie Preprocessor took 64.86ms. Allocated memory is still 234.9MB. Free memory was 133.5MB in the beginning and 129.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:24:25,383 INFO  L158              Benchmark]: RCFGBuilder took 555.98ms. Allocated memory is still 234.9MB. Free memory was 129.3MB in the beginning and 139.0MB in the end (delta: -9.6MB). Peak memory consumption was 26.6MB. Max. memory is 33.6GB.
[2025-05-07 17:24:25,383 INFO  L158              Benchmark]: TraceAbstraction took 5517.44ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 138.1MB in the beginning and 230.7MB in the end (delta: -92.6MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:24:25,383 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.19ms. Allocated memory is still 234.9MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 36.94ms. Allocated memory is still 234.9MB. Free memory was 137.5MB in the beginning and 133.5MB in the end (delta: 4.0MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 64.86ms. Allocated memory is still 234.9MB. Free memory was 133.5MB in the beginning and 129.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 555.98ms. Allocated memory is still 234.9MB. Free memory was 129.3MB in the beginning and 139.0MB in the end (delta: -9.6MB). Peak memory consumption was 26.6MB. Max. memory is 33.6GB.
 * TraceAbstraction took 5517.44ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 138.1MB in the beginning and 230.7MB in the end (delta: -92.6MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 46 procedures, 196 locations, 320 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 23973 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20175 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1630 IncrementalHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 3798 mSDtfsCounter, 1630 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=0, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 48 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1572 ConstructedInterpolants, 0 QuantifiedInterpolants, 2148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:24:25,394 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
