./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_chain_tree.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:22,631 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:22,684 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c51b8a3b-e03a-4fd9-8623-2ef43de04f1c/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:22,688 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:22,688 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:22,705 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:22,706 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:22,706 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:22,706 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:22,706 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:22,706 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:22,706 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:22,707 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:22,707 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:22,707 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:22,707 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:22,707 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:22,707 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:22,707 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:22,707 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:22,707 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:22,708 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:22,708 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:22,708 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:22,708 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:22,708 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:22,709 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:22,902 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:22,911 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:22,912 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:22,913 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:22,913 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:22,914 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c51b8a3b-e03a-4fd9-8623-2ef43de04f1c/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_chain_tree.sol_1_no_adts_000.smt2
[2025-05-07 17:28:22,915 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:22,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:23,362 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c51b8a3b-e03a-4fd9-8623-2ef43de04f1c/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_chain_tree.sol_1_no_adts_000.smt2
[2025-05-07 17:28:23,365 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:23,366 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:23,366 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:23,366 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:23,366 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:23,368 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,409 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23 Unit
[2025-05-07 17:28:23,409 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:23,409 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:23,410 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:23,410 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:23,420 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,420 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,446 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,446 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,454 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,456 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,458 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,462 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,464 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,479 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:23,479 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:23,480 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:23,480 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:23,480 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (1/1) ...
[2025-05-07 17:28:23,482 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:23,491 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:23,500 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:28:23,503 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:28:23,513 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:23,513 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:23,514 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:23,514 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_12_0 given in one single declaration
[2025-05-07 17:28:23,514 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_12_0
[2025-05-07 17:28:23,514 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_12_0
[2025-05-07 17:28:23,514 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_22_C_127_0 given in one single declaration
[2025-05-07 17:28:23,514 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_22_C_127_0
[2025-05-07 17:28:23,514 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_22_C_127_0
[2025-05-07 17:28:23,514 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_94_C_127_0 given in one single declaration
[2025-05-07 17:28:23,514 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_94_C_127_0
[2025-05-07 17:28:23,514 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_94_C_127_0
[2025-05-07 17:28:23,514 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_96_C_127_0 given in one single declaration
[2025-05-07 17:28:23,514 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_96_C_127_0
[2025-05-07 17:28:23,515 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_96_C_127_0
[2025-05-07 17:28:23,515 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_95_C_127_0 given in one single declaration
[2025-05-07 17:28:23,515 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_95_C_127_0
[2025-05-07 17:28:23,515 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_95_C_127_0
[2025-05-07 17:28:23,515 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_26_constructor_126_127_0 given in one single declaration
[2025-05-07 17:28:23,515 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_26_constructor_126_127_0
[2025-05-07 17:28:23,515 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_26_constructor_126_127_0
[2025-05-07 17:28:23,515 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_85_return_constructor_126_127_0 given in one single declaration
[2025-05-07 17:28:23,515 INFO  L130     BoogieDeclarations]: Found specification of procedure block_85_return_constructor_126_127_0
[2025-05-07 17:28:23,515 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_85_return_constructor_126_127_0
[2025-05-07 17:28:23,515 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_89__125_127_0 given in one single declaration
[2025-05-07 17:28:23,516 INFO  L130     BoogieDeclarations]: Found specification of procedure block_89__125_127_0
[2025-05-07 17:28:23,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_89__125_127_0
[2025-05-07 17:28:23,516 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_87_if_true__110_127_0 given in one single declaration
[2025-05-07 17:28:23,516 INFO  L130     BoogieDeclarations]: Found specification of procedure block_87_if_true__110_127_0
[2025-05-07 17:28:23,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_87_if_true__110_127_0
[2025-05-07 17:28:23,516 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_86_if_header__124_127_0 given in one single declaration
[2025-05-07 17:28:23,516 INFO  L130     BoogieDeclarations]: Found specification of procedure block_86_if_header__124_127_0
[2025-05-07 17:28:23,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_86_if_header__124_127_0
[2025-05-07 17:28:23,516 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_84__125_127_0 given in one single declaration
[2025-05-07 17:28:23,516 INFO  L130     BoogieDeclarations]: Found specification of procedure block_84__125_127_0
[2025-05-07 17:28:23,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_84__125_127_0
[2025-05-07 17:28:23,516 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_83_constructor_126_127_0 given in one single declaration
[2025-05-07 17:28:23,516 INFO  L130     BoogieDeclarations]: Found specification of procedure block_83_constructor_126_127_0
[2025-05-07 17:28:23,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_83_constructor_126_127_0
[2025-05-07 17:28:23,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_88_if_false__123_127_0 given in one single declaration
[2025-05-07 17:28:23,517 INFO  L130     BoogieDeclarations]: Found specification of procedure block_88_if_false__123_127_0
[2025-05-07 17:28:23,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_88_if_false__123_127_0
[2025-05-07 17:28:23,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_92_constructor_126_127_0 given in one single declaration
[2025-05-07 17:28:23,517 INFO  L130     BoogieDeclarations]: Found specification of procedure block_92_constructor_126_127_0
[2025-05-07 17:28:23,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_92_constructor_126_127_0
[2025-05-07 17:28:23,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_93_constructor_126_127_0 given in one single declaration
[2025-05-07 17:28:23,517 INFO  L130     BoogieDeclarations]: Found specification of procedure block_93_constructor_126_127_0
[2025-05-07 17:28:23,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_93_constructor_126_127_0
[2025-05-07 17:28:23,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_91_constructor_126_127_0 given in one single declaration
[2025-05-07 17:28:23,517 INFO  L130     BoogieDeclarations]: Found specification of procedure block_91_constructor_126_127_0
[2025-05-07 17:28:23,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_91_constructor_126_127_0
[2025-05-07 17:28:23,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_90_constructor_126_127_0 given in one single declaration
[2025-05-07 17:28:23,517 INFO  L130     BoogieDeclarations]: Found specification of procedure block_90_constructor_126_127_0
[2025-05-07 17:28:23,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_90_constructor_126_127_0
[2025-05-07 17:28:23,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_102_B_55_0 given in one single declaration
[2025-05-07 17:28:23,518 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_102_B_55_0
[2025-05-07 17:28:23,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_102_B_55_0
[2025-05-07 17:28:23,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_104_B_55_0 given in one single declaration
[2025-05-07 17:28:23,518 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_104_B_55_0
[2025-05-07 17:28:23,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_104_B_55_0
[2025-05-07 17:28:23,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_103_B_55_0 given in one single declaration
[2025-05-07 17:28:23,518 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_103_B_55_0
[2025-05-07 17:28:23,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_103_B_55_0
[2025-05-07 17:28:23,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_25_constructor_54_127_0 given in one single declaration
[2025-05-07 17:28:23,518 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_25_constructor_54_127_0
[2025-05-07 17:28:23,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_25_constructor_54_127_0
[2025-05-07 17:28:23,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_100_constructor_54_127_0 given in one single declaration
[2025-05-07 17:28:23,518 INFO  L130     BoogieDeclarations]: Found specification of procedure block_100_constructor_54_127_0
[2025-05-07 17:28:23,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_100_constructor_54_127_0
[2025-05-07 17:28:23,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_98__53_127_0 given in one single declaration
[2025-05-07 17:28:23,519 INFO  L130     BoogieDeclarations]: Found specification of procedure block_98__53_127_0
[2025-05-07 17:28:23,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_98__53_127_0
[2025-05-07 17:28:23,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_97_constructor_54_127_0 given in one single declaration
[2025-05-07 17:28:23,519 INFO  L130     BoogieDeclarations]: Found specification of procedure block_97_constructor_54_127_0
[2025-05-07 17:28:23,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_97_constructor_54_127_0
[2025-05-07 17:28:23,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_101_constructor_54_127_0 given in one single declaration
[2025-05-07 17:28:23,519 INFO  L130     BoogieDeclarations]: Found specification of procedure block_101_constructor_54_127_0
[2025-05-07 17:28:23,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_101_constructor_54_127_0
[2025-05-07 17:28:23,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_99_return_constructor_54_127_0 given in one single declaration
[2025-05-07 17:28:23,519 INFO  L130     BoogieDeclarations]: Found specification of procedure block_99_return_constructor_54_127_0
[2025-05-07 17:28:23,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_99_return_constructor_54_127_0
[2025-05-07 17:28:23,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_117_C_127_0 given in one single declaration
[2025-05-07 17:28:23,519 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_117_C_127_0
[2025-05-07 17:28:23,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_117_C_127_0
[2025-05-07 17:28:23,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_108_Z_26_0 given in one single declaration
[2025-05-07 17:28:23,520 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_108_Z_26_0
[2025-05-07 17:28:23,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_108_Z_26_0
[2025-05-07 17:28:23,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_24_constructor_25_127_0 given in one single declaration
[2025-05-07 17:28:23,520 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_24_constructor_25_127_0
[2025-05-07 17:28:23,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_24_constructor_25_127_0
[2025-05-07 17:28:23,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_107_return_constructor_25_127_0 given in one single declaration
[2025-05-07 17:28:23,520 INFO  L130     BoogieDeclarations]: Found specification of procedure block_107_return_constructor_25_127_0
[2025-05-07 17:28:23,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_107_return_constructor_25_127_0
[2025-05-07 17:28:23,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_106__24_127_0 given in one single declaration
[2025-05-07 17:28:23,520 INFO  L130     BoogieDeclarations]: Found specification of procedure block_106__24_127_0
[2025-05-07 17:28:23,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_106__24_127_0
[2025-05-07 17:28:23,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_105_constructor_25_127_0 given in one single declaration
[2025-05-07 17:28:23,520 INFO  L130     BoogieDeclarations]: Found specification of procedure block_105_constructor_25_127_0
[2025-05-07 17:28:23,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_105_constructor_25_127_0
[2025-05-07 17:28:23,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_110_Z_26_0 given in one single declaration
[2025-05-07 17:28:23,521 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_110_Z_26_0
[2025-05-07 17:28:23,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_110_Z_26_0
[2025-05-07 17:28:23,521 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_109_Z_26_0 given in one single declaration
[2025-05-07 17:28:23,521 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_109_Z_26_0
[2025-05-07 17:28:23,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_109_Z_26_0
[2025-05-07 17:28:23,521 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_114_A_13_0 given in one single declaration
[2025-05-07 17:28:23,521 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_114_A_13_0
[2025-05-07 17:28:23,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_114_A_13_0
[2025-05-07 17:28:23,521 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_23_constructor_12_127_0 given in one single declaration
[2025-05-07 17:28:23,521 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_23_constructor_12_127_0
[2025-05-07 17:28:23,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_23_constructor_12_127_0
[2025-05-07 17:28:23,521 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_113_return_constructor_12_127_0 given in one single declaration
[2025-05-07 17:28:23,521 INFO  L130     BoogieDeclarations]: Found specification of procedure block_113_return_constructor_12_127_0
[2025-05-07 17:28:23,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_113_return_constructor_12_127_0
[2025-05-07 17:28:23,521 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_112__11_127_0 given in one single declaration
[2025-05-07 17:28:23,521 INFO  L130     BoogieDeclarations]: Found specification of procedure block_112__11_127_0
[2025-05-07 17:28:23,522 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_112__11_127_0
[2025-05-07 17:28:23,522 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_111_constructor_12_127_0 given in one single declaration
[2025-05-07 17:28:23,522 INFO  L130     BoogieDeclarations]: Found specification of procedure block_111_constructor_12_127_0
[2025-05-07 17:28:23,522 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_111_constructor_12_127_0
[2025-05-07 17:28:23,522 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_116_A_13_0 given in one single declaration
[2025-05-07 17:28:23,522 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_116_A_13_0
[2025-05-07 17:28:23,522 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_116_A_13_0
[2025-05-07 17:28:23,522 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_115_A_13_0 given in one single declaration
[2025-05-07 17:28:23,522 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_115_A_13_0
[2025-05-07 17:28:23,522 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_115_A_13_0
[2025-05-07 17:28:23,522 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_10_B_55_0 given in one single declaration
[2025-05-07 17:28:23,522 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_10_B_55_0
[2025-05-07 17:28:23,522 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_10_B_55_0
[2025-05-07 17:28:23,522 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_46_B_55_0 given in one single declaration
[2025-05-07 17:28:23,522 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_46_B_55_0
[2025-05-07 17:28:23,523 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_46_B_55_0
[2025-05-07 17:28:23,523 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_13_constructor_54_55_0 given in one single declaration
[2025-05-07 17:28:23,523 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_13_constructor_54_55_0
[2025-05-07 17:28:23,523 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_13_constructor_54_55_0
[2025-05-07 17:28:23,523 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_44_constructor_54_55_0 given in one single declaration
[2025-05-07 17:28:23,523 INFO  L130     BoogieDeclarations]: Found specification of procedure block_44_constructor_54_55_0
[2025-05-07 17:28:23,523 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_44_constructor_54_55_0
[2025-05-07 17:28:23,523 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_42__53_55_0 given in one single declaration
[2025-05-07 17:28:23,523 INFO  L130     BoogieDeclarations]: Found specification of procedure block_42__53_55_0
[2025-05-07 17:28:23,523 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_42__53_55_0
[2025-05-07 17:28:23,523 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_41_constructor_54_55_0 given in one single declaration
[2025-05-07 17:28:23,523 INFO  L130     BoogieDeclarations]: Found specification of procedure block_41_constructor_54_55_0
[2025-05-07 17:28:23,523 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_41_constructor_54_55_0
[2025-05-07 17:28:23,523 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_45_constructor_54_55_0 given in one single declaration
[2025-05-07 17:28:23,523 INFO  L130     BoogieDeclarations]: Found specification of procedure block_45_constructor_54_55_0
[2025-05-07 17:28:23,523 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_45_constructor_54_55_0
[2025-05-07 17:28:23,523 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_43_return_constructor_54_55_0 given in one single declaration
[2025-05-07 17:28:23,524 INFO  L130     BoogieDeclarations]: Found specification of procedure block_43_return_constructor_54_55_0
[2025-05-07 17:28:23,524 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_43_return_constructor_54_55_0
[2025-05-07 17:28:23,524 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_48_B_55_0 given in one single declaration
[2025-05-07 17:28:23,524 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_48_B_55_0
[2025-05-07 17:28:23,524 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_48_B_55_0
[2025-05-07 17:28:23,524 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_47_B_55_0 given in one single declaration
[2025-05-07 17:28:23,524 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_47_B_55_0
[2025-05-07 17:28:23,524 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_47_B_55_0
[2025-05-07 17:28:23,524 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_52_Z_26_0 given in one single declaration
[2025-05-07 17:28:23,524 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_52_Z_26_0
[2025-05-07 17:28:23,524 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_52_Z_26_0
[2025-05-07 17:28:23,524 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_12_constructor_25_55_0 given in one single declaration
[2025-05-07 17:28:23,524 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_12_constructor_25_55_0
[2025-05-07 17:28:23,524 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_12_constructor_25_55_0
[2025-05-07 17:28:23,524 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_51_return_constructor_25_55_0 given in one single declaration
[2025-05-07 17:28:23,525 INFO  L130     BoogieDeclarations]: Found specification of procedure block_51_return_constructor_25_55_0
[2025-05-07 17:28:23,525 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_51_return_constructor_25_55_0
[2025-05-07 17:28:23,525 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_50__24_55_0 given in one single declaration
[2025-05-07 17:28:23,525 INFO  L130     BoogieDeclarations]: Found specification of procedure block_50__24_55_0
[2025-05-07 17:28:23,525 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_50__24_55_0
[2025-05-07 17:28:23,525 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_49_constructor_25_55_0 given in one single declaration
[2025-05-07 17:28:23,525 INFO  L130     BoogieDeclarations]: Found specification of procedure block_49_constructor_25_55_0
[2025-05-07 17:28:23,525 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_49_constructor_25_55_0
[2025-05-07 17:28:23,525 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_54_Z_26_0 given in one single declaration
[2025-05-07 17:28:23,525 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_54_Z_26_0
[2025-05-07 17:28:23,525 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_54_Z_26_0
[2025-05-07 17:28:23,525 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_53_Z_26_0 given in one single declaration
[2025-05-07 17:28:23,525 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_53_Z_26_0
[2025-05-07 17:28:23,525 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_53_Z_26_0
[2025-05-07 17:28:23,525 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_61_B_55_0 given in one single declaration
[2025-05-07 17:28:23,525 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_61_B_55_0
[2025-05-07 17:28:23,525 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_61_B_55_0
[2025-05-07 17:28:23,525 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_58_A_13_0 given in one single declaration
[2025-05-07 17:28:23,526 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_58_A_13_0
[2025-05-07 17:28:23,526 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_58_A_13_0
[2025-05-07 17:28:23,526 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_60_A_13_0 given in one single declaration
[2025-05-07 17:28:23,526 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_60_A_13_0
[2025-05-07 17:28:23,526 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_60_A_13_0
[2025-05-07 17:28:23,526 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_59_A_13_0 given in one single declaration
[2025-05-07 17:28:23,526 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_59_A_13_0
[2025-05-07 17:28:23,526 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_59_A_13_0
[2025-05-07 17:28:23,526 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_11_constructor_12_55_0 given in one single declaration
[2025-05-07 17:28:23,526 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_11_constructor_12_55_0
[2025-05-07 17:28:23,526 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_11_constructor_12_55_0
[2025-05-07 17:28:23,526 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_57_return_constructor_12_55_0 given in one single declaration
[2025-05-07 17:28:23,526 INFO  L130     BoogieDeclarations]: Found specification of procedure block_57_return_constructor_12_55_0
[2025-05-07 17:28:23,526 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_57_return_constructor_12_55_0
[2025-05-07 17:28:23,526 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_56__11_55_0 given in one single declaration
[2025-05-07 17:28:23,526 INFO  L130     BoogieDeclarations]: Found specification of procedure block_56__11_55_0
[2025-05-07 17:28:23,527 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_56__11_55_0
[2025-05-07 17:28:23,527 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_55_constructor_12_55_0 given in one single declaration
[2025-05-07 17:28:23,527 INFO  L130     BoogieDeclarations]: Found specification of procedure block_55_constructor_12_55_0
[2025-05-07 17:28:23,527 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_55_constructor_12_55_0
[2025-05-07 17:28:23,527 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:23,527 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:23,527 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:23,853 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:23,856 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:24,351 INFO  L?                        ?]: Removed 623 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:24,351 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:24,362 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:24,362 INFO  L312             CfgBuilder]: Removed 31 assume(true) statements.
[2025-05-07 17:28:24,363 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:24 BoogieIcfgContainer
[2025-05-07 17:28:24,363 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:24,364 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:24,364 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:24,367 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:24,367 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:23" (1/3) ...
[2025-05-07 17:28:24,368 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7d88c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:24, skipping insertion in model container
[2025-05-07 17:28:24,368 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:23" (2/3) ...
[2025-05-07 17:28:24,368 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7d88c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:24, skipping insertion in model container
[2025-05-07 17:28:24,368 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:24" (3/3) ...
[2025-05-07 17:28:24,369 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:24,380 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:24,382 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 68 procedures, 287 locations, 469 edges, 68 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:24,414 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:24,422 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;@5fececbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:24,422 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:24,425 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 287 states, 113 states have (on average 1.1504424778761062) internal successors, (130), 130 states have internal predecessors, (130), 105 states have call successors, (113), 67 states have call predecessors, (113), 67 states have return successors, (113), 89 states have call predecessors, (113), 105 states have call successors, (113)
[2025-05-07 17:28:24,436 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:24,436 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:24,437 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]
[2025-05-07 17:28:24,437 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:24,441 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:24,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -1561036787, now seen corresponding path program 1 times
[2025-05-07 17:28:24,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:24,447 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902841821]
[2025-05-07 17:28:24,447 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:24,447 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:24,486 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:24,522 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:24,522 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:24,522 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:24,691 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:28:24,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:24,692 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902841821]
[2025-05-07 17:28:24,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902841821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:24,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:24,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:24,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319037874]
[2025-05-07 17:28:24,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:24,700 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:24,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:24,737 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:24,738 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:24,741 INFO  L87              Difference]: Start difference. First operand  has 287 states, 113 states have (on average 1.1504424778761062) internal successors, (130), 130 states have internal predecessors, (130), 105 states have call successors, (113), 67 states have call predecessors, (113), 67 states have return successors, (113), 89 states have call predecessors, (113), 105 states have call successors, (113) Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:28:24,851 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:24,852 INFO  L93              Difference]: Finished difference Result 289 states and 361 transitions.
[2025-05-07 17:28:24,852 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:24,853 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 41
[2025-05-07 17:28:24,854 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:24,869 INFO  L225             Difference]: With dead ends: 289
[2025-05-07 17:28:24,869 INFO  L226             Difference]: Without dead ends: 289
[2025-05-07 17:28:24,870 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:28:24,872 INFO  L437           NwaCegarLoop]: 354 mSDtfsCounter, 1 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:24,873 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1032 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:24,883 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2025-05-07 17:28:24,911 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287.
[2025-05-07 17:28:24,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 287 states, 113 states have (on average 1.1415929203539823) internal successors, (129), 129 states have internal predecessors, (129), 105 states have call successors, (113), 67 states have call predecessors, (113), 68 states have return successors, (117), 90 states have call predecessors, (117), 105 states have call successors, (117)
[2025-05-07 17:28:24,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 359 transitions.
[2025-05-07 17:28:24,918 INFO  L79                 Accepts]: Start accepts. Automaton has 287 states and 359 transitions. Word has length 41
[2025-05-07 17:28:24,919 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:24,919 INFO  L485      AbstractCegarLoop]: Abstraction has 287 states and 359 transitions.
[2025-05-07 17:28:24,919 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:28:24,919 INFO  L278                IsEmpty]: Start isEmpty. Operand 287 states and 359 transitions.
[2025-05-07 17:28:24,921 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:24,921 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:24,921 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]
[2025-05-07 17:28:24,922 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:24,922 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:24,922 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:24,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -482562935, now seen corresponding path program 1 times
[2025-05-07 17:28:24,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:24,923 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69587295]
[2025-05-07 17:28:24,923 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:24,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:24,949 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:24,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:24,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:24,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,057 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:28:25,057 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,057 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69587295]
[2025-05-07 17:28:25,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69587295] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:25,057 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068179625]
[2025-05-07 17:28:25,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,059 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:25,059 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,059 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:25,059 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:25,059 INFO  L87              Difference]: Start difference. First operand 287 states and 359 transitions. Second operand  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:28:25,130 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:25,130 INFO  L93              Difference]: Finished difference Result 285 states and 352 transitions.
[2025-05-07 17:28:25,131 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:25,131 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 41
[2025-05-07 17:28:25,131 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:25,134 INFO  L225             Difference]: With dead ends: 285
[2025-05-07 17:28:25,134 INFO  L226             Difference]: Without dead ends: 281
[2025-05-07 17:28:25,134 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:28:25,135 INFO  L437           NwaCegarLoop]: 349 mSDtfsCounter, 0 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:25,135 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1728 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:25,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 281 states.
[2025-05-07 17:28:25,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281.
[2025-05-07 17:28:25,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 281 states, 112 states have (on average 1.125) internal successors, (126), 126 states have internal predecessors, (126), 101 states have call successors, (109), 67 states have call predecessors, (109), 67 states have return successors, (109), 87 states have call predecessors, (109), 101 states have call successors, (109)
[2025-05-07 17:28:25,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions.
[2025-05-07 17:28:25,157 INFO  L79                 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 41
[2025-05-07 17:28:25,157 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:25,157 INFO  L485      AbstractCegarLoop]: Abstraction has 281 states and 344 transitions.
[2025-05-07 17:28:25,157 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:28:25,158 INFO  L278                IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions.
[2025-05-07 17:28:25,159 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:25,160 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:25,160 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]
[2025-05-07 17:28:25,160 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:25,160 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:25,160 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:25,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 1477572842, now seen corresponding path program 1 times
[2025-05-07 17:28:25,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:25,161 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906781778]
[2025-05-07 17:28:25,161 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:25,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:25,183 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:25,199 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:25,199 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:25,199 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,289 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:28:25,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,290 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906781778]
[2025-05-07 17:28:25,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906781778] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,290 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:25,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53398507]
[2025-05-07 17:28:25,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,290 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:25,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,291 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:25,291 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:25,291 INFO  L87              Difference]: Start difference. First operand 281 states and 344 transitions. Second operand  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:28:25,343 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:25,343 INFO  L93              Difference]: Finished difference Result 280 states and 341 transitions.
[2025-05-07 17:28:25,344 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:25,344 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:28:25,344 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:25,346 INFO  L225             Difference]: With dead ends: 280
[2025-05-07 17:28:25,346 INFO  L226             Difference]: Without dead ends: 279
[2025-05-07 17:28:25,347 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:28:25,347 INFO  L437           NwaCegarLoop]: 338 mSDtfsCounter, 0 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:25,348 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1675 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:25,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2025-05-07 17:28:25,361 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279.
[2025-05-07 17:28:25,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 279 states, 112 states have (on average 1.1160714285714286) internal successors, (125), 125 states have internal predecessors, (125), 99 states have call successors, (107), 67 states have call predecessors, (107), 67 states have return successors, (107), 86 states have call predecessors, (107), 99 states have call successors, (107)
[2025-05-07 17:28:25,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 339 transitions.
[2025-05-07 17:28:25,364 INFO  L79                 Accepts]: Start accepts. Automaton has 279 states and 339 transitions. Word has length 41
[2025-05-07 17:28:25,364 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:25,364 INFO  L485      AbstractCegarLoop]: Abstraction has 279 states and 339 transitions.
[2025-05-07 17:28:25,364 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:28:25,365 INFO  L278                IsEmpty]: Start isEmpty. Operand 279 states and 339 transitions.
[2025-05-07 17:28:25,366 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:25,366 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:25,366 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]
[2025-05-07 17:28:25,367 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:25,367 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:25,367 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:25,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 1079402086, now seen corresponding path program 1 times
[2025-05-07 17:28:25,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:25,367 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518265668]
[2025-05-07 17:28:25,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:25,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:25,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:25,390 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:25,390 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:25,390 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,432 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:28:25,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,432 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518265668]
[2025-05-07 17:28:25,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518265668] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,432 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:25,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098483178]
[2025-05-07 17:28:25,432 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,432 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:25,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,433 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:25,433 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:25,433 INFO  L87              Difference]: Start difference. First operand 279 states and 339 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:28:25,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:25,478 INFO  L93              Difference]: Finished difference Result 280 states and 338 transitions.
[2025-05-07 17:28:25,478 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:25,478 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:28:25,478 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:25,480 INFO  L225             Difference]: With dead ends: 280
[2025-05-07 17:28:25,480 INFO  L226             Difference]: Without dead ends: 279
[2025-05-07 17:28:25,480 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:28:25,480 INFO  L437           NwaCegarLoop]: 332 mSDtfsCounter, 1 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:25,481 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 978 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:25,481 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2025-05-07 17:28:25,499 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277.
[2025-05-07 17:28:25,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 277 states, 112 states have (on average 1.1071428571428572) internal successors, (124), 124 states have internal predecessors, (124), 97 states have call successors, (105), 67 states have call predecessors, (105), 67 states have return successors, (105), 85 states have call predecessors, (105), 97 states have call successors, (105)
[2025-05-07 17:28:25,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 334 transitions.
[2025-05-07 17:28:25,500 INFO  L79                 Accepts]: Start accepts. Automaton has 277 states and 334 transitions. Word has length 41
[2025-05-07 17:28:25,500 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:25,500 INFO  L485      AbstractCegarLoop]: Abstraction has 277 states and 334 transitions.
[2025-05-07 17:28:25,501 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:28:25,501 INFO  L278                IsEmpty]: Start isEmpty. Operand 277 states and 334 transitions.
[2025-05-07 17:28:25,502 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:25,502 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:25,502 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]
[2025-05-07 17:28:25,502 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:28:25,502 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:25,502 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:25,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 64648543, now seen corresponding path program 1 times
[2025-05-07 17:28:25,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:25,503 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295901793]
[2025-05-07 17:28:25,503 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:25,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:25,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:25,534 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:25,534 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:25,534 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,589 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:28:25,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,589 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295901793]
[2025-05-07 17:28:25,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295901793] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:25,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410571830]
[2025-05-07 17:28:25,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,590 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:25,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,590 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:25,590 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:25,591 INFO  L87              Difference]: Start difference. First operand 277 states and 334 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:25,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:25,640 INFO  L93              Difference]: Finished difference Result 281 states and 340 transitions.
[2025-05-07 17:28:25,640 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:25,640 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:28:25,641 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:25,642 INFO  L225             Difference]: With dead ends: 281
[2025-05-07 17:28:25,643 INFO  L226             Difference]: Without dead ends: 281
[2025-05-07 17:28:25,643 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:28:25,644 INFO  L437           NwaCegarLoop]: 330 mSDtfsCounter, 1 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 967 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:28:25,644 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 967 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:25,645 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 281 states.
[2025-05-07 17:28:25,654 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279.
[2025-05-07 17:28:25,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 279 states, 113 states have (on average 1.1061946902654867) internal successors, (125), 125 states have internal predecessors, (125), 97 states have call successors, (105), 67 states have call predecessors, (105), 68 states have return successors, (108), 86 states have call predecessors, (108), 97 states have call successors, (108)
[2025-05-07 17:28:25,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 338 transitions.
[2025-05-07 17:28:25,657 INFO  L79                 Accepts]: Start accepts. Automaton has 279 states and 338 transitions. Word has length 66
[2025-05-07 17:28:25,657 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:25,657 INFO  L485      AbstractCegarLoop]: Abstraction has 279 states and 338 transitions.
[2025-05-07 17:28:25,657 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:25,657 INFO  L278                IsEmpty]: Start isEmpty. Operand 279 states and 338 transitions.
[2025-05-07 17:28:25,659 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:25,659 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:25,659 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]
[2025-05-07 17:28:25,659 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:28:25,659 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:25,660 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:25,660 INFO  L85        PathProgramCache]: Analyzing trace with hash 1140383459, now seen corresponding path program 1 times
[2025-05-07 17:28:25,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:25,660 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165924418]
[2025-05-07 17:28:25,660 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:25,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:25,689 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:25,708 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:25,708 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:25,708 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,787 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:28:25,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,788 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165924418]
[2025-05-07 17:28:25,788 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165924418] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:25,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106754741]
[2025-05-07 17:28:25,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,788 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:25,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,789 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:25,789 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:25,789 INFO  L87              Difference]: Start difference. First operand 279 states and 338 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:25,836 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:25,836 INFO  L93              Difference]: Finished difference Result 276 states and 330 transitions.
[2025-05-07 17:28:25,836 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:25,837 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:28:25,837 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:25,838 INFO  L225             Difference]: With dead ends: 276
[2025-05-07 17:28:25,839 INFO  L226             Difference]: Without dead ends: 272
[2025-05-07 17:28:25,839 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:28:25,839 INFO  L437           NwaCegarLoop]: 327 mSDtfsCounter, 0 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:25,840 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1619 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:25,840 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 272 states.
[2025-05-07 17:28:25,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272.
[2025-05-07 17:28:25,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 272 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 122 states have internal predecessors, (122), 92 states have call successors, (100), 67 states have call predecessors, (100), 67 states have return successors, (100), 82 states have call predecessors, (100), 92 states have call successors, (100)
[2025-05-07 17:28:25,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 322 transitions.
[2025-05-07 17:28:25,851 INFO  L79                 Accepts]: Start accepts. Automaton has 272 states and 322 transitions. Word has length 66
[2025-05-07 17:28:25,851 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:25,851 INFO  L485      AbstractCegarLoop]: Abstraction has 272 states and 322 transitions.
[2025-05-07 17:28:25,852 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:25,852 INFO  L278                IsEmpty]: Start isEmpty. Operand 272 states and 322 transitions.
[2025-05-07 17:28:25,853 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:25,853 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:25,854 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:28:25,854 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:25,854 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:25,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 1585930455, now seen corresponding path program 1 times
[2025-05-07 17:28:25,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:25,854 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837627232]
[2025-05-07 17:28:25,854 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:25,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:25,881 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:25,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:25,899 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:25,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,983 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:28:25,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,984 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837627232]
[2025-05-07 17:28:25,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837627232] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:25,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951438145]
[2025-05-07 17:28:25,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,984 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:25,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:25,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:25,985 INFO  L87              Difference]: Start difference. First operand 272 states and 322 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:26,028 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,028 INFO  L93              Difference]: Finished difference Result 272 states and 321 transitions.
[2025-05-07 17:28:26,028 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:26,029 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:28:26,029 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,030 INFO  L225             Difference]: With dead ends: 272
[2025-05-07 17:28:26,030 INFO  L226             Difference]: Without dead ends: 270
[2025-05-07 17:28:26,030 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:28:26,031 INFO  L437           NwaCegarLoop]: 318 mSDtfsCounter, 0 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1575 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:28:26,031 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1575 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 270 states.
[2025-05-07 17:28:26,039 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270.
[2025-05-07 17:28:26,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 270 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 121 states have internal predecessors, (121), 90 states have call successors, (98), 67 states have call predecessors, (98), 67 states have return successors, (98), 81 states have call predecessors, (98), 90 states have call successors, (98)
[2025-05-07 17:28:26,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 317 transitions.
[2025-05-07 17:28:26,041 INFO  L79                 Accepts]: Start accepts. Automaton has 270 states and 317 transitions. Word has length 66
[2025-05-07 17:28:26,041 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,042 INFO  L485      AbstractCegarLoop]: Abstraction has 270 states and 317 transitions.
[2025-05-07 17:28:26,042 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:26,042 INFO  L278                IsEmpty]: Start isEmpty. Operand 270 states and 317 transitions.
[2025-05-07 17:28:26,043 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:26,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,043 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]
[2025-05-07 17:28:26,043 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:28:26,044 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,044 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -910242341, now seen corresponding path program 1 times
[2025-05-07 17:28:26,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,044 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307803277]
[2025-05-07 17:28:26,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,070 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:26,074 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:26,074 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,074 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,132 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:28:26,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,132 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307803277]
[2025-05-07 17:28:26,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307803277] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:26,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953546354]
[2025-05-07 17:28:26,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,133 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:26,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,133 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:26,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:26,133 INFO  L87              Difference]: Start difference. First operand 270 states and 317 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:26,168 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,168 INFO  L93              Difference]: Finished difference Result 270 states and 314 transitions.
[2025-05-07 17:28:26,169 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:26,169 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:28:26,169 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,170 INFO  L225             Difference]: With dead ends: 270
[2025-05-07 17:28:26,170 INFO  L226             Difference]: Without dead ends: 269
[2025-05-07 17:28:26,171 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:28:26,171 INFO  L437           NwaCegarLoop]: 309 mSDtfsCounter, 1 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,171 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 913 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,172 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 269 states.
[2025-05-07 17:28:26,179 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267.
[2025-05-07 17:28:26,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 267 states, 112 states have (on average 1.0714285714285714) internal successors, (120), 120 states have internal predecessors, (120), 87 states have call successors, (95), 67 states have call predecessors, (95), 67 states have return successors, (95), 79 states have call predecessors, (95), 87 states have call successors, (95)
[2025-05-07 17:28:26,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 310 transitions.
[2025-05-07 17:28:26,181 INFO  L79                 Accepts]: Start accepts. Automaton has 267 states and 310 transitions. Word has length 66
[2025-05-07 17:28:26,181 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,181 INFO  L485      AbstractCegarLoop]: Abstraction has 267 states and 310 transitions.
[2025-05-07 17:28:26,181 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:26,181 INFO  L278                IsEmpty]: Start isEmpty. Operand 267 states and 310 transitions.
[2025-05-07 17:28:26,183 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:26,183 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,183 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]
[2025-05-07 17:28:26,183 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:28:26,183 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,183 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,184 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862256880, now seen corresponding path program 1 times
[2025-05-07 17:28:26,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,184 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10409388]
[2025-05-07 17:28:26,184 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,218 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:26,244 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:26,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,378 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:28:26,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,378 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10409388]
[2025-05-07 17:28:26,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10409388] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:26,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679173680]
[2025-05-07 17:28:26,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,379 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:26,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,379 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:26,379 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:26,379 INFO  L87              Difference]: Start difference. First operand 267 states and 310 transitions. Second operand  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:26,456 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,456 INFO  L93              Difference]: Finished difference Result 277 states and 326 transitions.
[2025-05-07 17:28:26,457 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:26,457 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) Word has length 91
[2025-05-07 17:28:26,457 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,458 INFO  L225             Difference]: With dead ends: 277
[2025-05-07 17:28:26,458 INFO  L226             Difference]: Without dead ends: 273
[2025-05-07 17:28:26,459 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:28:26,459 INFO  L437           NwaCegarLoop]: 308 mSDtfsCounter, 1 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,459 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1829 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:26,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2025-05-07 17:28:26,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273.
[2025-05-07 17:28:26,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 273 states, 114 states have (on average 1.0701754385964912) internal successors, (122), 122 states have internal predecessors, (122), 89 states have call successors, (97), 67 states have call predecessors, (97), 69 states have return successors, (101), 83 states have call predecessors, (101), 89 states have call successors, (101)
[2025-05-07 17:28:26,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 320 transitions.
[2025-05-07 17:28:26,466 INFO  L79                 Accepts]: Start accepts. Automaton has 273 states and 320 transitions. Word has length 91
[2025-05-07 17:28:26,467 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,467 INFO  L485      AbstractCegarLoop]: Abstraction has 273 states and 320 transitions.
[2025-05-07 17:28:26,467 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:26,467 INFO  L278                IsEmpty]: Start isEmpty. Operand 273 states and 320 transitions.
[2025-05-07 17:28:26,468 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:26,468 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,468 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]
[2025-05-07 17:28:26,468 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:28:26,468 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,469 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,469 INFO  L85        PathProgramCache]: Analyzing trace with hash -307193538, now seen corresponding path program 1 times
[2025-05-07 17:28:26,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,469 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469203301]
[2025-05-07 17:28:26,469 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,501 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:26,505 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:26,505 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,505 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,561 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:28:26,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,561 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469203301]
[2025-05-07 17:28:26,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469203301] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:26,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507927893]
[2025-05-07 17:28:26,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,562 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:26,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,562 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:26,562 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:26,562 INFO  L87              Difference]: Start difference. First operand 273 states and 320 transitions. Second operand  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:26,600 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,600 INFO  L93              Difference]: Finished difference Result 279 states and 328 transitions.
[2025-05-07 17:28:26,600 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:26,601 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 91
[2025-05-07 17:28:26,601 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,602 INFO  L225             Difference]: With dead ends: 279
[2025-05-07 17:28:26,602 INFO  L226             Difference]: Without dead ends: 279
[2025-05-07 17:28:26,602 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:28:26,602 INFO  L437           NwaCegarLoop]: 310 mSDtfsCounter, 1 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 909 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:28:26,602 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 909 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,603 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2025-05-07 17:28:26,608 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272.
[2025-05-07 17:28:26,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 272 states, 114 states have (on average 1.0701754385964912) internal successors, (122), 122 states have internal predecessors, (122), 88 states have call successors, (96), 67 states have call predecessors, (96), 69 states have return successors, (100), 82 states have call predecessors, (100), 88 states have call successors, (100)
[2025-05-07 17:28:26,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 318 transitions.
[2025-05-07 17:28:26,610 INFO  L79                 Accepts]: Start accepts. Automaton has 272 states and 318 transitions. Word has length 91
[2025-05-07 17:28:26,610 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,610 INFO  L485      AbstractCegarLoop]: Abstraction has 272 states and 318 transitions.
[2025-05-07 17:28:26,610 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:26,610 INFO  L278                IsEmpty]: Start isEmpty. Operand 272 states and 318 transitions.
[2025-05-07 17:28:26,611 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:26,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,611 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]
[2025-05-07 17:28:26,611 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:28:26,611 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,611 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 1807419122, now seen corresponding path program 1 times
[2025-05-07 17:28:26,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,611 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528426407]
[2025-05-07 17:28:26,611 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:26,661 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:26,661 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,661 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,833 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:28:26,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,833 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528426407]
[2025-05-07 17:28:26,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528426407] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:26,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944410355]
[2025-05-07 17:28:26,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,834 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:26,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,834 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:26,834 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:26,835 INFO  L87              Difference]: Start difference. First operand 272 states and 318 transitions. Second operand  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:26,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,923 INFO  L93              Difference]: Finished difference Result 276 states and 323 transitions.
[2025-05-07 17:28:26,924 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:26,924 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 91
[2025-05-07 17:28:26,924 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,926 INFO  L225             Difference]: With dead ends: 276
[2025-05-07 17:28:26,926 INFO  L226             Difference]: Without dead ends: 276
[2025-05-07 17:28:26,926 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:26,927 INFO  L437           NwaCegarLoop]: 302 mSDtfsCounter, 1 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,927 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1791 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:26,928 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 276 states.
[2025-05-07 17:28:26,939 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274.
[2025-05-07 17:28:26,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 274 states, 115 states have (on average 1.0695652173913044) internal successors, (123), 123 states have internal predecessors, (123), 88 states have call successors, (96), 67 states have call predecessors, (96), 70 states have return successors, (101), 83 states have call predecessors, (101), 88 states have call successors, (101)
[2025-05-07 17:28:26,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 320 transitions.
[2025-05-07 17:28:26,943 INFO  L79                 Accepts]: Start accepts. Automaton has 274 states and 320 transitions. Word has length 91
[2025-05-07 17:28:26,943 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,943 INFO  L485      AbstractCegarLoop]: Abstraction has 274 states and 320 transitions.
[2025-05-07 17:28:26,943 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:26,943 INFO  L278                IsEmpty]: Start isEmpty. Operand 274 states and 320 transitions.
[2025-05-07 17:28:26,945 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:26,945 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,946 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]
[2025-05-07 17:28:26,946 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:28:26,946 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,946 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,946 INFO  L85        PathProgramCache]: Analyzing trace with hash -1003852606, now seen corresponding path program 1 times
[2025-05-07 17:28:26,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,947 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581747872]
[2025-05-07 17:28:26,947 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,990 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:27,012 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:27,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:27,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:27,109 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:28:27,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:27,109 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581747872]
[2025-05-07 17:28:27,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581747872] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:27,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:27,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:27,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561315361]
[2025-05-07 17:28:27,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:27,110 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:27,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:27,111 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:27,111 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:27,111 INFO  L87              Difference]: Start difference. First operand 274 states and 320 transitions. Second operand  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:27,192 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:27,192 INFO  L93              Difference]: Finished difference Result 279 states and 326 transitions.
[2025-05-07 17:28:27,193 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:27,193 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) Word has length 91
[2025-05-07 17:28:27,193 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:27,195 INFO  L225             Difference]: With dead ends: 279
[2025-05-07 17:28:27,195 INFO  L226             Difference]: Without dead ends: 273
[2025-05-07 17:28:27,195 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:28:27,195 INFO  L437           NwaCegarLoop]: 315 mSDtfsCounter, 1 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:27,196 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1863 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:27,196 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2025-05-07 17:28:27,204 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265.
[2025-05-07 17:28:27,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 113 states have (on average 1.0619469026548674) internal successors, (120), 120 states have internal predecessors, (120), 83 states have call successors, (91), 67 states have call predecessors, (91), 68 states have return successors, (92), 77 states have call predecessors, (92), 83 states have call successors, (92)
[2025-05-07 17:28:27,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 303 transitions.
[2025-05-07 17:28:27,207 INFO  L79                 Accepts]: Start accepts. Automaton has 265 states and 303 transitions. Word has length 91
[2025-05-07 17:28:27,207 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:27,207 INFO  L485      AbstractCegarLoop]: Abstraction has 265 states and 303 transitions.
[2025-05-07 17:28:27,207 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:27,207 INFO  L278                IsEmpty]: Start isEmpty. Operand 265 states and 303 transitions.
[2025-05-07 17:28:27,209 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:27,209 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:27,209 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]
[2025-05-07 17:28:27,209 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:28:27,209 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:27,209 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:27,209 INFO  L85        PathProgramCache]: Analyzing trace with hash 265250407, now seen corresponding path program 1 times
[2025-05-07 17:28:27,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:27,210 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519514510]
[2025-05-07 17:28:27,210 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:27,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:27,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:27,250 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:27,250 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:27,250 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:27,326 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:28:27,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:27,326 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519514510]
[2025-05-07 17:28:27,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519514510] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:27,326 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:27,326 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:27,326 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987752036]
[2025-05-07 17:28:27,326 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:27,327 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:27,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:27,327 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:27,327 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:27,327 INFO  L87              Difference]: Start difference. First operand 265 states and 303 transitions. Second operand  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:28:27,342 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:27,342 INFO  L93              Difference]: Finished difference Result 267 states and 304 transitions.
[2025-05-07 17:28:27,343 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:27,343 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 91
[2025-05-07 17:28:27,343 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:27,345 INFO  L225             Difference]: With dead ends: 267
[2025-05-07 17:28:27,345 INFO  L226             Difference]: Without dead ends: 261
[2025-05-07 17:28:27,345 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:28:27,346 INFO  L437           NwaCegarLoop]: 302 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 893 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:28:27,346 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 893 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:27,347 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2025-05-07 17:28:27,355 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261.
[2025-05-07 17:28:27,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 261 states, 113 states have (on average 1.0530973451327434) internal successors, (119), 119 states have internal predecessors, (119), 79 states have call successors, (87), 67 states have call predecessors, (87), 68 states have return successors, (88), 74 states have call predecessors, (88), 79 states have call successors, (88)
[2025-05-07 17:28:27,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 294 transitions.
[2025-05-07 17:28:27,358 INFO  L79                 Accepts]: Start accepts. Automaton has 261 states and 294 transitions. Word has length 91
[2025-05-07 17:28:27,358 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:27,358 INFO  L485      AbstractCegarLoop]: Abstraction has 261 states and 294 transitions.
[2025-05-07 17:28:27,359 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:28:27,359 INFO  L278                IsEmpty]: Start isEmpty. Operand 261 states and 294 transitions.
[2025-05-07 17:28:27,360 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:27,361 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:27,361 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]
[2025-05-07 17:28:27,361 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:28:27,361 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:27,361 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:27,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 704957791, now seen corresponding path program 1 times
[2025-05-07 17:28:27,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:27,362 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842609630]
[2025-05-07 17:28:27,362 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:27,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:27,396 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:27,402 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:27,402 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:27,402 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:27,454 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:28:27,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:27,455 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842609630]
[2025-05-07 17:28:27,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842609630] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:27,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:27,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:27,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804790205]
[2025-05-07 17:28:27,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:27,455 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:27,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:27,455 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:27,456 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:27,456 INFO  L87              Difference]: Start difference. First operand 261 states and 294 transitions. Second operand  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:27,471 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:27,471 INFO  L93              Difference]: Finished difference Result 263 states and 295 transitions.
[2025-05-07 17:28:27,471 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:27,472 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 91
[2025-05-07 17:28:27,472 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:27,473 INFO  L225             Difference]: With dead ends: 263
[2025-05-07 17:28:27,473 INFO  L226             Difference]: Without dead ends: 259
[2025-05-07 17:28:27,473 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:28:27,473 INFO  L437           NwaCegarLoop]: 291 mSDtfsCounter, 1 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 861 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:28:27,473 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 861 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:27,474 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 259 states.
[2025-05-07 17:28:27,478 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259.
[2025-05-07 17:28:27,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 259 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 118 states have internal predecessors, (118), 77 states have call successors, (85), 67 states have call predecessors, (85), 68 states have return successors, (86), 73 states have call predecessors, (86), 77 states have call successors, (86)
[2025-05-07 17:28:27,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 289 transitions.
[2025-05-07 17:28:27,480 INFO  L79                 Accepts]: Start accepts. Automaton has 259 states and 289 transitions. Word has length 91
[2025-05-07 17:28:27,480 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:27,480 INFO  L485      AbstractCegarLoop]: Abstraction has 259 states and 289 transitions.
[2025-05-07 17:28:27,480 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:27,480 INFO  L278                IsEmpty]: Start isEmpty. Operand 259 states and 289 transitions.
[2025-05-07 17:28:27,481 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:27,481 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:27,481 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]
[2025-05-07 17:28:27,481 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:28:27,481 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:27,482 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:27,482 INFO  L85        PathProgramCache]: Analyzing trace with hash -13006879, now seen corresponding path program 1 times
[2025-05-07 17:28:27,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:27,482 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461383615]
[2025-05-07 17:28:27,482 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:27,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:27,506 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:27,537 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:27,538 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:27,538 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,302 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:28:28,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:28,302 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461383615]
[2025-05-07 17:28:28,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461383615] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:28,302 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:28,302 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-05-07 17:28:28,302 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862003890]
[2025-05-07 17:28:28,302 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:28,302 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-05-07 17:28:28,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:28,303 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-05-07 17:28:28,303 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462
[2025-05-07 17:28:28,303 INFO  L87              Difference]: Start difference. First operand 259 states and 289 transitions. Second operand  has 22 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 18 states have internal predecessors, (41), 11 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (25), 16 states have call predecessors, (25), 11 states have call successors, (25)
[2025-05-07 17:28:28,604 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:28,605 INFO  L93              Difference]: Finished difference Result 263 states and 292 transitions.
[2025-05-07 17:28:28,605 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-05-07 17:28:28,605 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 18 states have internal predecessors, (41), 11 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (25), 16 states have call predecessors, (25), 11 states have call successors, (25) Word has length 91
[2025-05-07 17:28:28,605 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:28,607 INFO  L225             Difference]: With dead ends: 263
[2025-05-07 17:28:28,607 INFO  L226             Difference]: Without dead ends: 255
[2025-05-07 17:28:28,607 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702
[2025-05-07 17:28:28,608 INFO  L437           NwaCegarLoop]: 272 mSDtfsCounter, 6 mSDsluCounter, 5388 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5660 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:28,608 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5660 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:28,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 255 states.
[2025-05-07 17:28:28,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255.
[2025-05-07 17:28:28,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 255 states, 111 states have (on average 1.045045045045045) internal successors, (116), 116 states have internal predecessors, (116), 76 states have call successors, (83), 66 states have call predecessors, (83), 67 states have return successors, (84), 72 states have call predecessors, (84), 76 states have call successors, (84)
[2025-05-07 17:28:28,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 283 transitions.
[2025-05-07 17:28:28,614 INFO  L79                 Accepts]: Start accepts. Automaton has 255 states and 283 transitions. Word has length 91
[2025-05-07 17:28:28,615 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:28,615 INFO  L485      AbstractCegarLoop]: Abstraction has 255 states and 283 transitions.
[2025-05-07 17:28:28,615 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 18 states have internal predecessors, (41), 11 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (25), 16 states have call predecessors, (25), 11 states have call successors, (25)
[2025-05-07 17:28:28,615 INFO  L278                IsEmpty]: Start isEmpty. Operand 255 states and 283 transitions.
[2025-05-07 17:28:28,616 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:28,616 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:28,616 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]
[2025-05-07 17:28:28,616 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:28:28,616 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:28,616 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:28,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -14270885, now seen corresponding path program 1 times
[2025-05-07 17:28:28,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:28,616 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100572023]
[2025-05-07 17:28:28,616 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:28,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:28,640 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:28,652 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:28,652 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:28,652 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,745 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:28:28,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:28,745 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100572023]
[2025-05-07 17:28:28,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100572023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:28,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:28,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:28,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039412172]
[2025-05-07 17:28:28,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:28,746 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:28,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:28,747 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:28,747 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:28,747 INFO  L87              Difference]: Start difference. First operand 255 states and 283 transitions. Second operand  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:28,787 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:28,787 INFO  L93              Difference]: Finished difference Result 262 states and 290 transitions.
[2025-05-07 17:28:28,788 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:28,788 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) Word has length 91
[2025-05-07 17:28:28,788 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:28,790 INFO  L225             Difference]: With dead ends: 262
[2025-05-07 17:28:28,790 INFO  L226             Difference]: Without dead ends: 251
[2025-05-07 17:28:28,790 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:28:28,791 INFO  L437           NwaCegarLoop]: 278 mSDtfsCounter, 1 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:28,791 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1656 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:28,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 251 states.
[2025-05-07 17:28:28,798 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251.
[2025-05-07 17:28:28,799 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 251 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 114 states have internal predecessors, (114), 75 states have call successors, (81), 65 states have call predecessors, (81), 66 states have return successors, (82), 71 states have call predecessors, (82), 75 states have call successors, (82)
[2025-05-07 17:28:28,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions.
[2025-05-07 17:28:28,801 INFO  L79                 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 91
[2025-05-07 17:28:28,801 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:28,801 INFO  L485      AbstractCegarLoop]: Abstraction has 251 states and 277 transitions.
[2025-05-07 17:28:28,802 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:28,802 INFO  L278                IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions.
[2025-05-07 17:28:28,803 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:28,803 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:28,803 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]
[2025-05-07 17:28:28,803 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:28:28,803 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:28,804 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:28,804 INFO  L85        PathProgramCache]: Analyzing trace with hash -2070163827, now seen corresponding path program 1 times
[2025-05-07 17:28:28,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:28,804 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799469356]
[2025-05-07 17:28:28,804 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:28,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:28,843 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:28,862 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:28,862 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:28,862 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,973 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:28:28,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:28,973 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799469356]
[2025-05-07 17:28:28,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799469356] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:28,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:28,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:28,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477215626]
[2025-05-07 17:28:28,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:28,974 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:28,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:28,974 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:28,974 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:28,974 INFO  L87              Difference]: Start difference. First operand 251 states and 277 transitions. Second operand  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:29,011 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:29,011 INFO  L93              Difference]: Finished difference Result 222 states and 247 transitions.
[2025-05-07 17:28:29,011 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:29,012 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) Word has length 91
[2025-05-07 17:28:29,012 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:29,013 INFO  L225             Difference]: With dead ends: 222
[2025-05-07 17:28:29,013 INFO  L226             Difference]: Without dead ends: 168
[2025-05-07 17:28:29,013 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:28:29,014 INFO  L437           NwaCegarLoop]: 243 mSDtfsCounter, 1 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:29,014 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1443 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:29,014 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 168 states.
[2025-05-07 17:28:29,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168.
[2025-05-07 17:28:29,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 168 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 76 states have internal predecessors, (76), 52 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (59), 49 states have call predecessors, (59), 52 states have call successors, (59)
[2025-05-07 17:28:29,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions.
[2025-05-07 17:28:29,020 INFO  L79                 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 91
[2025-05-07 17:28:29,020 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:29,021 INFO  L485      AbstractCegarLoop]: Abstraction has 168 states and 193 transitions.
[2025-05-07 17:28:29,021 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:29,021 INFO  L278                IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions.
[2025-05-07 17:28:29,022 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-05-07 17:28:29,022 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:29,022 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, 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:28:29,023 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-05-07 17:28:29,023 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:29,023 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:29,023 INFO  L85        PathProgramCache]: Analyzing trace with hash 1463734303, now seen corresponding path program 1 times
[2025-05-07 17:28:29,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:29,023 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237150638]
[2025-05-07 17:28:29,023 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:29,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:29,071 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-05-07 17:28:29,074 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-05-07 17:28:29,075 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:29,075 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:29,179 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:28:29,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:29,179 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237150638]
[2025-05-07 17:28:29,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237150638] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:29,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:29,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:29,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871841763]
[2025-05-07 17:28:29,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:29,180 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:29,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:29,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:29,181 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:29,181 INFO  L87              Difference]: Start difference. First operand 168 states and 193 transitions. Second operand  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-05-07 17:28:29,191 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:29,191 INFO  L93              Difference]: Finished difference Result 170 states and 194 transitions.
[2025-05-07 17:28:29,192 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:29,192 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 124
[2025-05-07 17:28:29,192 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:29,193 INFO  L225             Difference]: With dead ends: 170
[2025-05-07 17:28:29,193 INFO  L226             Difference]: Without dead ends: 163
[2025-05-07 17:28:29,194 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:28:29,194 INFO  L437           NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 562 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:28:29,194 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 562 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:29,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 163 states.
[2025-05-07 17:28:29,200 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163.
[2025-05-07 17:28:29,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 163 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 75 states have internal predecessors, (75), 47 states have call successors, (53), 42 states have call predecessors, (53), 43 states have return successors, (54), 45 states have call predecessors, (54), 47 states have call successors, (54)
[2025-05-07 17:28:29,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 182 transitions.
[2025-05-07 17:28:29,202 INFO  L79                 Accepts]: Start accepts. Automaton has 163 states and 182 transitions. Word has length 124
[2025-05-07 17:28:29,202 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:29,202 INFO  L485      AbstractCegarLoop]: Abstraction has 163 states and 182 transitions.
[2025-05-07 17:28:29,202 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-05-07 17:28:29,202 INFO  L278                IsEmpty]: Start isEmpty. Operand 163 states and 182 transitions.
[2025-05-07 17:28:29,204 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-05-07 17:28:29,204 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:29,204 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, 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:28:29,204 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-05-07 17:28:29,204 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:29,204 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:29,205 INFO  L85        PathProgramCache]: Analyzing trace with hash 968008094, now seen corresponding path program 1 times
[2025-05-07 17:28:29,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:29,205 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522688934]
[2025-05-07 17:28:29,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:29,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:29,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-05-07 17:28:29,271 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-05-07 17:28:29,271 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:29,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:29,343 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:28:29,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:29,343 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522688934]
[2025-05-07 17:28:29,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522688934] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:29,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:29,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:29,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692010225]
[2025-05-07 17:28:29,343 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:29,344 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:29,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:29,344 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:29,345 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:29,345 INFO  L87              Difference]: Start difference. First operand 163 states and 182 transitions. Second operand  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34)
[2025-05-07 17:28:29,352 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:29,352 INFO  L93              Difference]: Finished difference Result 165 states and 183 transitions.
[2025-05-07 17:28:29,353 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:29,353 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 124
[2025-05-07 17:28:29,353 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:29,354 INFO  L225             Difference]: With dead ends: 165
[2025-05-07 17:28:29,354 INFO  L226             Difference]: Without dead ends: 161
[2025-05-07 17:28:29,354 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:28:29,355 INFO  L437           NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 528 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:28:29,355 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 528 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:29,356 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 161 states.
[2025-05-07 17:28:29,360 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159.
[2025-05-07 17:28:29,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 159 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 45 states have call successors, (51), 42 states have call predecessors, (51), 42 states have return successors, (51), 43 states have call predecessors, (51), 45 states have call successors, (51)
[2025-05-07 17:28:29,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions.
[2025-05-07 17:28:29,361 INFO  L79                 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 124
[2025-05-07 17:28:29,361 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:29,361 INFO  L485      AbstractCegarLoop]: Abstraction has 159 states and 175 transitions.
[2025-05-07 17:28:29,362 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34)
[2025-05-07 17:28:29,362 INFO  L278                IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions.
[2025-05-07 17:28:29,363 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-05-07 17:28:29,363 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:29,363 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, 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:28:29,363 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:28:29,363 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:29,364 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:29,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917723742, now seen corresponding path program 1 times
[2025-05-07 17:28:29,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:29,364 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574485100]
[2025-05-07 17:28:29,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:29,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:29,400 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-05-07 17:28:29,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-05-07 17:28:29,413 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:29,413 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:29,497 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:28:29,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:29,497 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574485100]
[2025-05-07 17:28:29,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574485100] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:29,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:29,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:29,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701067023]
[2025-05-07 17:28:29,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:29,498 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:29,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:29,499 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:29,499 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:29,499 INFO  L87              Difference]: Start difference. First operand 159 states and 175 transitions. Second operand  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34)
[2025-05-07 17:28:29,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:29,513 INFO  L93              Difference]: Finished difference Result 161 states and 176 transitions.
[2025-05-07 17:28:29,513 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:29,513 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 124
[2025-05-07 17:28:29,513 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:29,514 INFO  L225             Difference]: With dead ends: 161
[2025-05-07 17:28:29,514 INFO  L226             Difference]: Without dead ends: 157
[2025-05-07 17:28:29,514 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:28:29,515 INFO  L437           NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 509 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:28:29,515 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 509 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:29,515 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 157 states.
[2025-05-07 17:28:29,518 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157.
[2025-05-07 17:28:29,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 72 states have internal predecessors, (72), 43 states have call successors, (49), 42 states have call predecessors, (49), 42 states have return successors, (49), 42 states have call predecessors, (49), 43 states have call successors, (49)
[2025-05-07 17:28:29,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions.
[2025-05-07 17:28:29,520 INFO  L79                 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 124
[2025-05-07 17:28:29,520 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:29,520 INFO  L485      AbstractCegarLoop]: Abstraction has 157 states and 170 transitions.
[2025-05-07 17:28:29,520 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (34), 1 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34)
[2025-05-07 17:28:29,520 INFO  L278                IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions.
[2025-05-07 17:28:29,521 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-05-07 17:28:29,521 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:29,521 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, 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:28:29,521 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:28:29,521 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:29,522 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:29,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -391360500, now seen corresponding path program 1 times
[2025-05-07 17:28:29,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:29,522 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103773711]
[2025-05-07 17:28:29,522 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:29,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:29,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-05-07 17:28:29,593 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-05-07 17:28:29,593 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:29,593 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:29,744 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:28:29,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:29,745 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103773711]
[2025-05-07 17:28:29,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103773711] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:29,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:29,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:29,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106991626]
[2025-05-07 17:28:29,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:29,745 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:29,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:29,746 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:29,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:29,746 INFO  L87              Difference]: Start difference. First operand 157 states and 170 transitions. Second operand  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34)
[2025-05-07 17:28:29,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:29,784 INFO  L93              Difference]: Finished difference Result 165 states and 179 transitions.
[2025-05-07 17:28:29,784 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:29,784 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34) Word has length 124
[2025-05-07 17:28:29,785 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:29,785 INFO  L225             Difference]: With dead ends: 165
[2025-05-07 17:28:29,786 INFO  L226             Difference]: Without dead ends: 153
[2025-05-07 17:28:29,786 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:28:29,786 INFO  L437           NwaCegarLoop]: 176 mSDtfsCounter, 1 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1039 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:28:29,787 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1039 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:29,787 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2025-05-07 17:28:29,791 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153.
[2025-05-07 17:28:29,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 153 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 70 states have internal predecessors, (70), 42 states have call successors, (47), 41 states have call predecessors, (47), 41 states have return successors, (47), 41 states have call predecessors, (47), 42 states have call successors, (47)
[2025-05-07 17:28:29,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions.
[2025-05-07 17:28:29,792 INFO  L79                 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 124
[2025-05-07 17:28:29,793 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:29,793 INFO  L485      AbstractCegarLoop]: Abstraction has 153 states and 164 transitions.
[2025-05-07 17:28:29,793 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34)
[2025-05-07 17:28:29,793 INFO  L278                IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions.
[2025-05-07 17:28:29,794 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-05-07 17:28:29,794 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:29,794 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, 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:28:29,795 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-05-07 17:28:29,795 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:29,795 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:29,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -1152220954, now seen corresponding path program 1 times
[2025-05-07 17:28:29,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:29,795 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216306257]
[2025-05-07 17:28:29,795 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:29,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:29,841 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-05-07 17:28:29,862 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-05-07 17:28:29,862 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:29,862 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:29,972 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:28:29,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:29,973 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216306257]
[2025-05-07 17:28:29,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216306257] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:29,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:29,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:29,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631235359]
[2025-05-07 17:28:29,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:29,973 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:29,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:29,974 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:29,974 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:29,974 INFO  L87              Difference]: Start difference. First operand 153 states and 164 transitions. Second operand  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34)
[2025-05-07 17:28:30,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:30,005 INFO  L93              Difference]: Finished difference Result 161 states and 173 transitions.
[2025-05-07 17:28:30,006 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:30,006 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34) Word has length 124
[2025-05-07 17:28:30,006 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:30,007 INFO  L225             Difference]: With dead ends: 161
[2025-05-07 17:28:30,007 INFO  L226             Difference]: Without dead ends: 149
[2025-05-07 17:28:30,007 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:28:30,008 INFO  L437           NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 987 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:28:30,008 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:30,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2025-05-07 17:28:30,010 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149.
[2025-05-07 17:28:30,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 68 states have internal predecessors, (68), 41 states have call successors, (45), 40 states have call predecessors, (45), 40 states have return successors, (45), 40 states have call predecessors, (45), 41 states have call successors, (45)
[2025-05-07 17:28:30,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions.
[2025-05-07 17:28:30,011 INFO  L79                 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 124
[2025-05-07 17:28:30,012 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:30,012 INFO  L485      AbstractCegarLoop]: Abstraction has 149 states and 158 transitions.
[2025-05-07 17:28:30,012 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34)
[2025-05-07 17:28:30,012 INFO  L278                IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions.
[2025-05-07 17:28:30,012 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-05-07 17:28:30,013 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:30,013 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, 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:28:30,013 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-05-07 17:28:30,013 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:30,013 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:30,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 2015518548, now seen corresponding path program 1 times
[2025-05-07 17:28:30,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:30,013 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629996666]
[2025-05-07 17:28:30,013 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:30,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:30,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-05-07 17:28:30,068 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-05-07 17:28:30,068 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:30,068 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:30,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:28:30,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:30,165 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629996666]
[2025-05-07 17:28:30,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629996666] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:30,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:30,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:30,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343567344]
[2025-05-07 17:28:30,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:30,166 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:30,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:30,166 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:30,166 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:30,166 INFO  L87              Difference]: Start difference. First operand 149 states and 158 transitions. Second operand  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34)
[2025-05-07 17:28:30,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:30,197 INFO  L93              Difference]: Finished difference Result 157 states and 167 transitions.
[2025-05-07 17:28:30,198 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:30,198 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34) Word has length 124
[2025-05-07 17:28:30,198 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:30,199 INFO  L225             Difference]: With dead ends: 157
[2025-05-07 17:28:30,199 INFO  L226             Difference]: Without dead ends: 145
[2025-05-07 17:28:30,200 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:28:30,200 INFO  L437           NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 930 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:28:30,200 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 930 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:30,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-05-07 17:28:30,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145.
[2025-05-07 17:28:30,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 66 states have internal predecessors, (66), 40 states have call successors, (43), 39 states have call predecessors, (43), 39 states have return successors, (43), 39 states have call predecessors, (43), 40 states have call successors, (43)
[2025-05-07 17:28:30,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions.
[2025-05-07 17:28:30,203 INFO  L79                 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 124
[2025-05-07 17:28:30,203 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:30,204 INFO  L485      AbstractCegarLoop]: Abstraction has 145 states and 152 transitions.
[2025-05-07 17:28:30,204 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34)
[2025-05-07 17:28:30,204 INFO  L278                IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions.
[2025-05-07 17:28:30,204 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-05-07 17:28:30,204 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:30,204 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, 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:28:30,205 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-05-07 17:28:30,205 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:30,205 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:30,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -1281596820, now seen corresponding path program 1 times
[2025-05-07 17:28:30,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:30,205 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213953334]
[2025-05-07 17:28:30,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:30,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:30,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-05-07 17:28:30,260 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-05-07 17:28:30,260 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:30,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:30,378 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:28:30,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:30,378 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213953334]
[2025-05-07 17:28:30,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213953334] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:30,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:30,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:30,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772103226]
[2025-05-07 17:28:30,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:30,379 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:30,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:30,379 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:30,379 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:30,380 INFO  L87              Difference]: Start difference. First operand 145 states and 152 transitions. Second operand  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34)
[2025-05-07 17:28:30,417 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:30,417 INFO  L93              Difference]: Finished difference Result 153 states and 161 transitions.
[2025-05-07 17:28:30,417 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:30,418 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34) Word has length 124
[2025-05-07 17:28:30,418 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:30,418 INFO  L225             Difference]: With dead ends: 153
[2025-05-07 17:28:30,418 INFO  L226             Difference]: Without dead ends: 141
[2025-05-07 17:28:30,418 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:28:30,419 INFO  L437           NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 915 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:28:30,419 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 915 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:30,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2025-05-07 17:28:30,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141.
[2025-05-07 17:28:30,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 141 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 64 states have internal predecessors, (64), 39 states have call successors, (41), 38 states have call predecessors, (41), 38 states have return successors, (41), 38 states have call predecessors, (41), 39 states have call successors, (41)
[2025-05-07 17:28:30,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions.
[2025-05-07 17:28:30,422 INFO  L79                 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 124
[2025-05-07 17:28:30,422 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:30,422 INFO  L485      AbstractCegarLoop]: Abstraction has 141 states and 146 transitions.
[2025-05-07 17:28:30,423 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34)
[2025-05-07 17:28:30,423 INFO  L278                IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions.
[2025-05-07 17:28:30,423 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-05-07 17:28:30,423 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:30,423 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-05-07 17:28:30,424 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:30,424 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:30,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -1175503190, now seen corresponding path program 1 times
[2025-05-07 17:28:30,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:30,424 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546375570]
[2025-05-07 17:28:30,424 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:30,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:30,466 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-05-07 17:28:30,480 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-05-07 17:28:30,480 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:30,480 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:30,553 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:28:30,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:30,553 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546375570]
[2025-05-07 17:28:30,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546375570] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:30,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:30,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:28:30,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45169632]
[2025-05-07 17:28:30,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:30,554 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:28:30,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:30,554 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:28:30,555 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:30,555 INFO  L87              Difference]: Start difference. First operand 141 states and 146 transitions. Second operand  has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (35), 1 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:28:30,575 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:30,575 INFO  L93              Difference]: Finished difference Result 143 states and 147 transitions.
[2025-05-07 17:28:30,576 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:30,576 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (35), 1 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 127
[2025-05-07 17:28:30,576 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:30,577 INFO  L225             Difference]: With dead ends: 143
[2025-05-07 17:28:30,577 INFO  L226             Difference]: Without dead ends: 137
[2025-05-07 17:28:30,577 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:30,577 INFO  L437           NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:30,577 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 569 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:30,578 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2025-05-07 17:28:30,579 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137.
[2025-05-07 17:28:30,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 137 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 62 states have internal predecessors, (62), 38 states have call successors, (39), 37 states have call predecessors, (39), 37 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39)
[2025-05-07 17:28:30,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions.
[2025-05-07 17:28:30,580 INFO  L79                 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 127
[2025-05-07 17:28:30,580 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:30,580 INFO  L485      AbstractCegarLoop]: Abstraction has 137 states and 140 transitions.
[2025-05-07 17:28:30,580 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (35), 1 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:28:30,580 INFO  L278                IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions.
[2025-05-07 17:28:30,581 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-05-07 17:28:30,581 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:30,581 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, 1, 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:28:30,581 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-05-07 17:28:30,581 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:30,582 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:30,582 INFO  L85        PathProgramCache]: Analyzing trace with hash 196530939, now seen corresponding path program 1 times
[2025-05-07 17:28:30,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:30,582 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073107269]
[2025-05-07 17:28:30,582 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:30,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:30,622 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-05-07 17:28:30,636 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-05-07 17:28:30,636 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:30,636 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:30,716 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:28:30,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:30,717 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073107269]
[2025-05-07 17:28:30,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073107269] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:30,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:30,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:28:30,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971147995]
[2025-05-07 17:28:30,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:30,717 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:28:30,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:30,718 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:28:30,718 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:30,719 INFO  L87              Difference]: Start difference. First operand 137 states and 140 transitions. Second operand  has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (35), 1 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:28:30,736 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:30,736 INFO  L93              Difference]: Finished difference Result 139 states and 141 transitions.
[2025-05-07 17:28:30,737 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:30,737 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (35), 1 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 127
[2025-05-07 17:28:30,737 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:30,738 INFO  L225             Difference]: With dead ends: 139
[2025-05-07 17:28:30,738 INFO  L226             Difference]: Without dead ends: 133
[2025-05-07 17:28:30,738 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:30,738 INFO  L437           NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:30,739 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 542 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:30,739 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-05-07 17:28:30,741 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2025-05-07 17:28:30,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 37 states have call successors, (37), 36 states have call predecessors, (37), 36 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37)
[2025-05-07 17:28:30,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions.
[2025-05-07 17:28:30,742 INFO  L79                 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 127
[2025-05-07 17:28:30,742 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:30,742 INFO  L485      AbstractCegarLoop]: Abstraction has 133 states and 134 transitions.
[2025-05-07 17:28:30,742 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (35), 1 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:28:30,742 INFO  L278                IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions.
[2025-05-07 17:28:30,743 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-05-07 17:28:30,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:30,743 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, 1, 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:28:30,743 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-05-07 17:28:30,743 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:30,743 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:30,743 INFO  L85        PathProgramCache]: Analyzing trace with hash 1107643261, now seen corresponding path program 1 times
[2025-05-07 17:28:30,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:30,743 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446753079]
[2025-05-07 17:28:30,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:30,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:30,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-05-07 17:28:30,794 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-05-07 17:28:30,794 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:30,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:30,969 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:28:30,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:30,969 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446753079]
[2025-05-07 17:28:30,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446753079] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:30,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:30,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:28:30,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288893289]
[2025-05-07 17:28:30,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:30,970 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:28:30,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:30,970 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:28:30,970 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:30,971 INFO  L87              Difference]: Start difference. First operand 133 states and 134 transitions. Second operand  has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (35), 1 states have call predecessors, (35), 8 states have return successors, (35), 8 states have call predecessors, (35), 5 states have call successors, (35)
[2025-05-07 17:28:31,040 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:31,040 INFO  L93              Difference]: Finished difference Result 139 states and 139 transitions.
[2025-05-07 17:28:31,040 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:28:31,040 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (35), 1 states have call predecessors, (35), 8 states have return successors, (35), 8 states have call predecessors, (35), 5 states have call successors, (35) Word has length 127
[2025-05-07 17:28:31,041 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:31,042 INFO  L225             Difference]: With dead ends: 139
[2025-05-07 17:28:31,042 INFO  L226             Difference]: Without dead ends: 128
[2025-05-07 17:28:31,042 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:31,042 INFO  L437           NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:31,042 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1123 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:31,043 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-05-07 17:28:31,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128.
[2025-05-07 17:28:31,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 128 states, 57 states have (on average 1.0) internal successors, (57), 57 states have internal predecessors, (57), 35 states have call successors, (35), 35 states have call predecessors, (35), 35 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35)
[2025-05-07 17:28:31,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 127 transitions.
[2025-05-07 17:28:31,047 INFO  L79                 Accepts]: Start accepts. Automaton has 128 states and 127 transitions. Word has length 127
[2025-05-07 17:28:31,047 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:31,047 INFO  L485      AbstractCegarLoop]: Abstraction has 128 states and 127 transitions.
[2025-05-07 17:28:31,047 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (35), 1 states have call predecessors, (35), 8 states have return successors, (35), 8 states have call predecessors, (35), 5 states have call successors, (35)
[2025-05-07 17:28:31,047 INFO  L278                IsEmpty]: Start isEmpty. Operand 128 states and 127 transitions.
[2025-05-07 17:28:31,048 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-05-07 17:28:31,048 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:31,049 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, 1, 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:28:31,049 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-05-07 17:28:31,049 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:31,049 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:31,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 1549915354, now seen corresponding path program 1 times
[2025-05-07 17:28:31,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:31,049 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193156562]
[2025-05-07 17:28:31,049 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:31,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:31,095 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-05-07 17:28:31,118 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-05-07 17:28:31,119 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:31,119 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:31,322 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:28:31,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:31,322 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193156562]
[2025-05-07 17:28:31,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193156562] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:31,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:31,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:28:31,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250402053]
[2025-05-07 17:28:31,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:31,323 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:28:31,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:31,324 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:28:31,324 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:31,324 INFO  L87              Difference]: Start difference. First operand 128 states and 127 transitions. Second operand  has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (35), 1 states have call predecessors, (35), 8 states have return successors, (35), 8 states have call predecessors, (35), 5 states have call successors, (35)
[2025-05-07 17:28:31,378 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:31,378 INFO  L93              Difference]: Finished difference Result 107 states and 106 transitions.
[2025-05-07 17:28:31,379 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:28:31,379 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (35), 1 states have call predecessors, (35), 8 states have return successors, (35), 8 states have call predecessors, (35), 5 states have call successors, (35) Word has length 127
[2025-05-07 17:28:31,379 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:31,379 INFO  L225             Difference]: With dead ends: 107
[2025-05-07 17:28:31,379 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:28:31,380 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:31,380 INFO  L437           NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:31,380 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 889 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:31,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:28:31,381 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:28:31,381 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:28:31,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:28:31,381 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127
[2025-05-07 17:28:31,381 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:31,381 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:28:31,381 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (35), 1 states have call predecessors, (35), 8 states have return successors, (35), 8 states have call predecessors, (35), 5 states have call successors, (35)
[2025-05-07 17:28:31,382 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:28:31,382 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:28:31,384 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:28:31,385 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-05-07 17:28:31,388 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, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:31,390 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:28:31,393 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:28:31 BoogieIcfgContainer
[2025-05-07 17:28:31,393 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:28:31,394 INFO  L158              Benchmark]: Toolchain (without parser) took 8027.86ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 187.0MB in the beginning and 272.7MB in the end (delta: -85.7MB). Peak memory consumption was 125.3MB. Max. memory is 33.6GB.
[2025-05-07 17:28:31,394 INFO  L158              Benchmark]: SmtParser took 0.22ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:31,394 INFO  L158              Benchmark]: ChcToBoogie took 43.11ms. Allocated memory is still 234.9MB. Free memory was 187.0MB in the beginning and 180.5MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:31,394 INFO  L158              Benchmark]: Boogie Preprocessor took 69.52ms. Allocated memory is still 234.9MB. Free memory was 180.5MB in the beginning and 175.2MB in the end (delta: 5.3MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:28:31,394 INFO  L158              Benchmark]: RCFGBuilder took 883.49ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 175.2MB in the beginning and 209.4MB in the end (delta: -34.2MB). Peak memory consumption was 76.5MB. Max. memory is 33.6GB.
[2025-05-07 17:28:31,395 INFO  L158              Benchmark]: TraceAbstraction took 7028.60ms. Allocated memory was 302.0MB in the beginning and 436.2MB in the end (delta: 134.2MB). Free memory was 208.5MB in the beginning and 272.7MB in the end (delta: -64.3MB). Peak memory consumption was 82.3MB. Max. memory is 33.6GB.
[2025-05-07 17:28:31,396 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.22ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 43.11ms. Allocated memory is still 234.9MB. Free memory was 187.0MB in the beginning and 180.5MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 69.52ms. Allocated memory is still 234.9MB. Free memory was 180.5MB in the beginning and 175.2MB in the end (delta: 5.3MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * RCFGBuilder took 883.49ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 175.2MB in the beginning and 209.4MB in the end (delta: -34.2MB). Peak memory consumption was 76.5MB. Max. memory is 33.6GB.
 * TraceAbstraction took 7028.60ms. Allocated memory was 302.0MB in the beginning and 436.2MB in the end (delta: 134.2MB). Free memory was 208.5MB in the beginning and 272.7MB in the end (delta: -64.3MB). Peak memory consumption was 82.3MB. 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 68 procedures, 287 locations, 469 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 35985 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28996 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 903 IncrementalHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 6989 mSDtfsCounter, 903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=0, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 27 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2623 NumberOfCodeBlocks, 2623 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2595 ConstructedInterpolants, 0 QuantifiedInterpolants, 3210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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:28:31,409 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
