./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-195.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:22,258 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:22,356 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff238b1c-7e95-4520-ad8b-4be8c338509c/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:22,364 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:22,365 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:22,404 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:22,405 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:22,406 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:22,406 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:22,407 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:22,408 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:22,408 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:22,408 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:22,408 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:22,408 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:22,409 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:22,409 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:22,409 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:22,409 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:22,409 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:22,409 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:22,409 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:22,409 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:22,410 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:22,410 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:22,412 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:22,412 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:22,754 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:22,765 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:22,767 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:22,769 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:22,770 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:22,772 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff238b1c-7e95-4520-ad8b-4be8c338509c/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-195.smt2
[2025-04-28 21:21:22,777 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:22,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:23,381 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff238b1c-7e95-4520-ad8b-4be8c338509c/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-195.smt2
[2025-04-28 21:21:23,385 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:23,387 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:23,388 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:23,389 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:23,389 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:23,393 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,479 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23 Unit
[2025-04-28 21:21:23,479 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:23,480 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:23,480 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:23,480 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:23,503 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,503 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,561 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,562 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,572 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,574 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,577 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,581 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,584 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,607 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:23,608 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:23,608 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:23,609 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:23,610 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,617 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:23,635 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:23,654 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-04-28 21:21:23,659 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:23,674 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:23,674 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:23,674 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:23,674 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-04-28 21:21:23,674 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-04-28 21:21:23,674 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-04-28 21:21:23,675 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_11_A_71_0 given in one single declaration
[2025-04-28 21:21:23,675 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_11_A_71_0
[2025-04-28 21:21:23,675 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_11_A_71_0
[2025-04-28 21:21:23,675 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_41_A_71_0 given in one single declaration
[2025-04-28 21:21:23,675 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_41_A_71_0
[2025-04-28 21:21:23,675 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_41_A_71_0
[2025-04-28 21:21:23,675 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_43_A_71_0 given in one single declaration
[2025-04-28 21:21:23,675 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_43_A_71_0
[2025-04-28 21:21:23,675 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_43_A_71_0
[2025-04-28 21:21:23,675 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_42_A_71_0 given in one single declaration
[2025-04-28 21:21:23,675 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_42_A_71_0
[2025-04-28 21:21:23,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_42_A_71_0
[2025-04-28 21:21:23,676 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_14_constructor_70_71_0 given in one single declaration
[2025-04-28 21:21:23,676 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_14_constructor_70_71_0
[2025-04-28 21:21:23,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_14_constructor_70_71_0
[2025-04-28 21:21:23,676 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_40_constructor_70_71_0 given in one single declaration
[2025-04-28 21:21:23,676 INFO  L130     BoogieDeclarations]: Found specification of procedure block_40_constructor_70_71_0
[2025-04-28 21:21:23,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_40_constructor_70_71_0
[2025-04-28 21:21:23,676 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_36__69_71_0 given in one single declaration
[2025-04-28 21:21:23,676 INFO  L130     BoogieDeclarations]: Found specification of procedure block_36__69_71_0
[2025-04-28 21:21:23,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_36__69_71_0
[2025-04-28 21:21:23,677 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_35_constructor_70_71_0 given in one single declaration
[2025-04-28 21:21:23,677 INFO  L130     BoogieDeclarations]: Found specification of procedure block_35_constructor_70_71_0
[2025-04-28 21:21:23,677 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_35_constructor_70_71_0
[2025-04-28 21:21:23,677 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_return_constructor_70_71_0 given in one single declaration
[2025-04-28 21:21:23,677 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_return_constructor_70_71_0
[2025-04-28 21:21:23,677 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_return_constructor_70_71_0
[2025-04-28 21:21:23,677 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_38_constructor_70_71_0 given in one single declaration
[2025-04-28 21:21:23,677 INFO  L130     BoogieDeclarations]: Found specification of procedure block_38_constructor_70_71_0
[2025-04-28 21:21:23,677 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_38_constructor_70_71_0
[2025-04-28 21:21:23,677 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_39_constructor_70_71_0 given in one single declaration
[2025-04-28 21:21:23,677 INFO  L130     BoogieDeclarations]: Found specification of procedure block_39_constructor_70_71_0
[2025-04-28 21:21:23,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_39_constructor_70_71_0
[2025-04-28 21:21:23,678 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_47_B_30_0 given in one single declaration
[2025-04-28 21:21:23,678 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_47_B_30_0
[2025-04-28 21:21:23,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_47_B_30_0
[2025-04-28 21:21:23,678 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_13_constructor_29_71_0 given in one single declaration
[2025-04-28 21:21:23,678 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_13_constructor_29_71_0
[2025-04-28 21:21:23,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_13_constructor_29_71_0
[2025-04-28 21:21:23,678 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_46_return_constructor_29_71_0 given in one single declaration
[2025-04-28 21:21:23,678 INFO  L130     BoogieDeclarations]: Found specification of procedure block_46_return_constructor_29_71_0
[2025-04-28 21:21:23,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_46_return_constructor_29_71_0
[2025-04-28 21:21:23,678 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_45__28_71_0 given in one single declaration
[2025-04-28 21:21:23,679 INFO  L130     BoogieDeclarations]: Found specification of procedure block_45__28_71_0
[2025-04-28 21:21:23,679 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_45__28_71_0
[2025-04-28 21:21:23,679 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_44_constructor_29_71_0 given in one single declaration
[2025-04-28 21:21:23,679 INFO  L130     BoogieDeclarations]: Found specification of procedure block_44_constructor_29_71_0
[2025-04-28 21:21:23,679 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_44_constructor_29_71_0
[2025-04-28 21:21:23,679 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_49_B_30_0 given in one single declaration
[2025-04-28 21:21:23,679 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_49_B_30_0
[2025-04-28 21:21:23,679 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_49_B_30_0
[2025-04-28 21:21:23,679 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_48_B_30_0 given in one single declaration
[2025-04-28 21:21:23,679 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_48_B_30_0
[2025-04-28 21:21:23,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_48_B_30_0
[2025-04-28 21:21:23,680 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_53_C_13_0 given in one single declaration
[2025-04-28 21:21:23,680 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_53_C_13_0
[2025-04-28 21:21:23,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_53_C_13_0
[2025-04-28 21:21:23,680 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_55_C_13_0 given in one single declaration
[2025-04-28 21:21:23,680 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_55_C_13_0
[2025-04-28 21:21:23,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_55_C_13_0
[2025-04-28 21:21:23,680 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_54_C_13_0 given in one single declaration
[2025-04-28 21:21:23,680 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_54_C_13_0
[2025-04-28 21:21:23,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_54_C_13_0
[2025-04-28 21:21:23,681 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_12_constructor_12_71_0 given in one single declaration
[2025-04-28 21:21:23,681 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_12_constructor_12_71_0
[2025-04-28 21:21:23,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_12_constructor_12_71_0
[2025-04-28 21:21:23,681 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_52_return_constructor_12_71_0 given in one single declaration
[2025-04-28 21:21:23,681 INFO  L130     BoogieDeclarations]: Found specification of procedure block_52_return_constructor_12_71_0
[2025-04-28 21:21:23,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_52_return_constructor_12_71_0
[2025-04-28 21:21:23,681 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_51__11_71_0 given in one single declaration
[2025-04-28 21:21:23,681 INFO  L130     BoogieDeclarations]: Found specification of procedure block_51__11_71_0
[2025-04-28 21:21:23,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_51__11_71_0
[2025-04-28 21:21:23,681 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_50_constructor_12_71_0 given in one single declaration
[2025-04-28 21:21:23,681 INFO  L130     BoogieDeclarations]: Found specification of procedure block_50_constructor_12_71_0
[2025-04-28 21:21:23,682 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_50_constructor_12_71_0
[2025-04-28 21:21:23,682 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_56_A_71_0 given in one single declaration
[2025-04-28 21:21:23,682 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_56_A_71_0
[2025-04-28 21:21:23,682 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_56_A_71_0
[2025-04-28 21:21:23,682 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:23,682 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:23,682 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:23,990 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:23,994 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:24,566 INFO  L?                        ?]: Removed 294 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:24,566 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:24,585 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:24,585 INFO  L312             CfgBuilder]: Removed 13 assume(true) statements.
[2025-04-28 21:21:24,586 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:24 BoogieIcfgContainer
[2025-04-28 21:21:24,586 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:24,590 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:24,591 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:24,594 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:24,594 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:23" (1/3) ...
[2025-04-28 21:21:24,594 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4e975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:24, skipping insertion in model container
[2025-04-28 21:21:24,595 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (2/3) ...
[2025-04-28 21:21:24,595 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4e975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:24, skipping insertion in model container
[2025-04-28 21:21:24,595 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:24" (3/3) ...
[2025-04-28 21:21:24,596 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:24,610 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:24,613 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 29 procedures, 121 locations, 193 edges, 29 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:24,657 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:24,670 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;@28ffc51e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:24,670 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:24,674 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 121 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 43 states have call successors, (46), 28 states have call predecessors, (46), 28 states have return successors, (46), 37 states have call predecessors, (46), 43 states have call successors, (46)
[2025-04-28 21:21:24,688 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:24,688 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:24,689 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-04-28 21:21:24,689 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:24,695 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:24,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -483698524, now seen corresponding path program 1 times
[2025-04-28 21:21:24,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:24,705 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604966597]
[2025-04-28 21:21:24,705 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,706 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:24,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-04-28 21:21:24,884 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:24,885 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,885 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:25,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:25,263 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604966597]
[2025-04-28 21:21:25,263 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604966597] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:25,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:25,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:25,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128012292]
[2025-04-28 21:21:25,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:25,278 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:25,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:25,316 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:25,316 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:25,320 INFO  L87              Difference]: Start difference. First operand  has 121 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 43 states have call successors, (46), 28 states have call predecessors, (46), 28 states have return successors, (46), 37 states have call predecessors, (46), 43 states have call successors, (46) 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-04-28 21:21:25,563 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:25,564 INFO  L93              Difference]: Finished difference Result 123 states and 151 transitions.
[2025-04-28 21:21:25,566 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:25,567 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-04-28 21:21:25,568 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:25,578 INFO  L225             Difference]: With dead ends: 123
[2025-04-28 21:21:25,578 INFO  L226             Difference]: Without dead ends: 123
[2025-04-28 21:21:25,580 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-04-28 21:21:25,584 INFO  L437           NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 403 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:25,585 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 403 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:25,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2025-04-28 21:21:25,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121.
[2025-04-28 21:21:25,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 121 states, 48 states have (on average 1.125) internal successors, (54), 54 states have internal predecessors, (54), 43 states have call successors, (46), 28 states have call predecessors, (46), 29 states have return successors, (49), 38 states have call predecessors, (49), 43 states have call successors, (49)
[2025-04-28 21:21:25,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions.
[2025-04-28 21:21:25,674 INFO  L79                 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 41
[2025-04-28 21:21:25,675 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:25,676 INFO  L485      AbstractCegarLoop]: Abstraction has 121 states and 149 transitions.
[2025-04-28 21:21:25,676 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-04-28 21:21:25,677 INFO  L278                IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions.
[2025-04-28 21:21:25,681 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:25,684 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:25,684 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-04-28 21:21:25,685 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:25,685 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:25,686 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:25,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -222243544, now seen corresponding path program 1 times
[2025-04-28 21:21:25,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:25,686 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049016983]
[2025-04-28 21:21:25,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,687 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:25,734 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-04-28 21:21:25,813 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:25,815 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,815 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:26,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:26,084 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049016983]
[2025-04-28 21:21:26,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049016983] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:26,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:26,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:26,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065143026]
[2025-04-28 21:21:26,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:26,087 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:26,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:26,088 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:26,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:26,089 INFO  L87              Difference]: Start difference. First operand 121 states and 149 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-04-28 21:21:26,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:26,196 INFO  L93              Difference]: Finished difference Result 118 states and 141 transitions.
[2025-04-28 21:21:26,197 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:26,197 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-04-28 21:21:26,197 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:26,200 INFO  L225             Difference]: With dead ends: 118
[2025-04-28 21:21:26,202 INFO  L226             Difference]: Without dead ends: 115
[2025-04-28 21:21:26,202 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-04-28 21:21:26,204 INFO  L437           NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:26,204 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:26,207 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2025-04-28 21:21:26,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115.
[2025-04-28 21:21:26,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 115 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 51 states have internal predecessors, (51), 39 states have call successors, (42), 28 states have call predecessors, (42), 28 states have return successors, (42), 35 states have call predecessors, (42), 39 states have call successors, (42)
[2025-04-28 21:21:26,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions.
[2025-04-28 21:21:26,229 INFO  L79                 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 41
[2025-04-28 21:21:26,230 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:26,230 INFO  L485      AbstractCegarLoop]: Abstraction has 115 states and 135 transitions.
[2025-04-28 21:21:26,230 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-04-28 21:21:26,230 INFO  L278                IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions.
[2025-04-28 21:21:26,232 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-04-28 21:21:26,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:26,232 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-04-28 21:21:26,233 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:26,233 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:26,233 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:26,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 925294913, now seen corresponding path program 1 times
[2025-04-28 21:21:26,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:26,236 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814851276]
[2025-04-28 21:21:26,236 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:26,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:26,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-04-28 21:21:26,362 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-04-28 21:21:26,362 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,362 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:26,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:26,565 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814851276]
[2025-04-28 21:21:26,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814851276] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:26,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:26,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:26,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169397477]
[2025-04-28 21:21:26,566 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:26,566 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:26,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:26,567 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:26,567 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:26,567 INFO  L87              Difference]: Start difference. First operand 115 states and 135 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18)
[2025-04-28 21:21:26,654 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:26,655 INFO  L93              Difference]: Finished difference Result 115 states and 134 transitions.
[2025-04-28 21:21:26,658 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:26,658 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), 3 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) Word has length 66
[2025-04-28 21:21:26,659 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:26,660 INFO  L225             Difference]: With dead ends: 115
[2025-04-28 21:21:26,660 INFO  L226             Difference]: Without dead ends: 113
[2025-04-28 21:21:26,660 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-04-28 21:21:26,661 INFO  L437           NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 640 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:26,665 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 640 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:26,666 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-04-28 21:21:26,679 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2025-04-28 21:21:26,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 50 states have internal predecessors, (50), 37 states have call successors, (40), 28 states have call predecessors, (40), 28 states have return successors, (40), 34 states have call predecessors, (40), 37 states have call successors, (40)
[2025-04-28 21:21:26,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions.
[2025-04-28 21:21:26,684 INFO  L79                 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 66
[2025-04-28 21:21:26,685 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:26,685 INFO  L485      AbstractCegarLoop]: Abstraction has 113 states and 130 transitions.
[2025-04-28 21:21:26,685 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), 3 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18)
[2025-04-28 21:21:26,685 INFO  L278                IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions.
[2025-04-28 21:21:26,687 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-04-28 21:21:26,687 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:26,687 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-04-28 21:21:26,691 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:26,692 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:26,692 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:26,692 INFO  L85        PathProgramCache]: Analyzing trace with hash -153178939, now seen corresponding path program 1 times
[2025-04-28 21:21:26,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:26,693 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733659682]
[2025-04-28 21:21:26,693 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:26,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:26,753 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-04-28 21:21:26,787 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-04-28 21:21:26,787 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,787 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:26,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:26,991 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733659682]
[2025-04-28 21:21:26,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733659682] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:26,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:26,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:26,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082869891]
[2025-04-28 21:21:26,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:26,992 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:26,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:26,992 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:26,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:26,993 INFO  L87              Difference]: Start difference. First operand 113 states and 130 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)
[2025-04-28 21:21:27,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,056 INFO  L93              Difference]: Finished difference Result 115 states and 131 transitions.
[2025-04-28 21:21:27,057 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:27,057 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), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 66
[2025-04-28 21:21:27,058 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,059 INFO  L225             Difference]: With dead ends: 115
[2025-04-28 21:21:27,063 INFO  L226             Difference]: Without dead ends: 112
[2025-04-28 21:21:27,064 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-04-28 21:21:27,065 INFO  L437           NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 362 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-04-28 21:21:27,065 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 362 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:27,066 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2025-04-28 21:21:27,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110.
[2025-04-28 21:21:27,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 110 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 34 states have call successors, (37), 28 states have call predecessors, (37), 28 states have return successors, (37), 32 states have call predecessors, (37), 34 states have call successors, (37)
[2025-04-28 21:21:27,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions.
[2025-04-28 21:21:27,081 INFO  L79                 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 66
[2025-04-28 21:21:27,084 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,084 INFO  L485      AbstractCegarLoop]: Abstraction has 110 states and 123 transitions.
[2025-04-28 21:21:27,084 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), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)
[2025-04-28 21:21:27,084 INFO  L278                IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions.
[2025-04-28 21:21:27,086 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-04-28 21:21:27,087 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,087 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-04-28 21:21:27,087 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:27,087 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,088 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,090 INFO  L85        PathProgramCache]: Analyzing trace with hash -1615735642, now seen corresponding path program 1 times
[2025-04-28 21:21:27,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,091 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962625840]
[2025-04-28 21:21:27,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,166 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-04-28 21:21:27,215 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-04-28 21:21:27,218 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,219 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:27,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,437 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962625840]
[2025-04-28 21:21:27,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962625840] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:27,437 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:27,437 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:27,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961813300]
[2025-04-28 21:21:27,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,438 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:27,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,439 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:27,439 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,442 INFO  L87              Difference]: Start difference. First operand 110 states and 123 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), 4 states have call predecessors, (25), 3 states have call successors, (25)
[2025-04-28 21:21:27,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,496 INFO  L93              Difference]: Finished difference Result 114 states and 127 transitions.
[2025-04-28 21:21:27,497 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:27,498 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), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 91
[2025-04-28 21:21:27,498 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,499 INFO  L225             Difference]: With dead ends: 114
[2025-04-28 21:21:27,499 INFO  L226             Difference]: Without dead ends: 114
[2025-04-28 21:21:27,500 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-04-28 21:21:27,503 INFO  L437           NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,503 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 355 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:27,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2025-04-28 21:21:27,518 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112.
[2025-04-28 21:21:27,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 50 states have internal predecessors, (50), 34 states have call successors, (37), 28 states have call predecessors, (37), 29 states have return successors, (38), 33 states have call predecessors, (38), 34 states have call successors, (38)
[2025-04-28 21:21:27,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions.
[2025-04-28 21:21:27,520 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 91
[2025-04-28 21:21:27,523 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,523 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 125 transitions.
[2025-04-28 21:21:27,523 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), 4 states have call predecessors, (25), 3 states have call successors, (25)
[2025-04-28 21:21:27,523 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions.
[2025-04-28 21:21:27,525 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-04-28 21:21:27,525 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,525 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-04-28 21:21:27,525 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:27,525 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,528 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,529 INFO  L85        PathProgramCache]: Analyzing trace with hash 1251066611, now seen corresponding path program 1 times
[2025-04-28 21:21:27,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,529 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210824370]
[2025-04-28 21:21:27,529 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,594 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-04-28 21:21:27,607 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-04-28 21:21:27,607 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,607 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:27,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,825 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210824370]
[2025-04-28 21:21:27,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210824370] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:27,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:27,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:27,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393253731]
[2025-04-28 21:21:27,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,827 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:27,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,827 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:27,828 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,828 INFO  L87              Difference]: Start difference. First operand 112 states and 125 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-04-28 21:21:27,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,846 INFO  L93              Difference]: Finished difference Result 114 states and 126 transitions.
[2025-04-28 21:21:27,846 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:27,846 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-04-28 21:21:27,847 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,849 INFO  L225             Difference]: With dead ends: 114
[2025-04-28 21:21:27,849 INFO  L226             Difference]: Without dead ends: 104
[2025-04-28 21:21:27,850 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-04-28 21:21:27,851 INFO  L437           NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 359 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-04-28 21:21:27,853 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 359 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:27,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2025-04-28 21:21:27,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104.
[2025-04-28 21:21:27,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 47 states have (on average 1.0) internal successors, (47), 47 states have internal predecessors, (47), 28 states have call successors, (31), 28 states have call predecessors, (31), 28 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31)
[2025-04-28 21:21:27,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions.
[2025-04-28 21:21:27,863 INFO  L79                 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 91
[2025-04-28 21:21:27,863 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,863 INFO  L485      AbstractCegarLoop]: Abstraction has 104 states and 109 transitions.
[2025-04-28 21:21:27,863 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-04-28 21:21:27,863 INFO  L278                IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions.
[2025-04-28 21:21:27,865 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-04-28 21:21:27,865 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,865 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-04-28 21:21:27,865 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:27,865 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,867 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,867 INFO  L85        PathProgramCache]: Analyzing trace with hash 228494716, now seen corresponding path program 1 times
[2025-04-28 21:21:27,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,868 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552343063]
[2025-04-28 21:21:27,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,925 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-04-28 21:21:27,974 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-04-28 21:21:27,975 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:28,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,367 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552343063]
[2025-04-28 21:21:28,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552343063] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:28,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:28,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:28,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144266925]
[2025-04-28 21:21:28,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,369 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:28,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,370 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:28,370 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:28,371 INFO  L87              Difference]: Start difference. First operand 104 states and 109 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-04-28 21:21:28,504 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,504 INFO  L93              Difference]: Finished difference Result 106 states and 110 transitions.
[2025-04-28 21:21:28,505 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:28,505 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-04-28 21:21:28,506 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,507 INFO  L225             Difference]: With dead ends: 106
[2025-04-28 21:21:28,508 INFO  L226             Difference]: Without dead ends: 100
[2025-04-28 21:21:28,508 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:28,509 INFO  L437           NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,509 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 604 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:28,510 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2025-04-28 21:21:28,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100.
[2025-04-28 21:21:28,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 45 states have (on average 1.0) internal successors, (45), 45 states have internal predecessors, (45), 27 states have call successors, (29), 27 states have call predecessors, (29), 27 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29)
[2025-04-28 21:21:28,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions.
[2025-04-28 21:21:28,518 INFO  L79                 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 91
[2025-04-28 21:21:28,518 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,518 INFO  L485      AbstractCegarLoop]: Abstraction has 100 states and 103 transitions.
[2025-04-28 21:21:28,519 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-04-28 21:21:28,519 INFO  L278                IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions.
[2025-04-28 21:21:28,520 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-04-28 21:21:28,520 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,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]
[2025-04-28 21:21:28,521 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-04-28 21:21:28,521 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,522 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -41034786, now seen corresponding path program 1 times
[2025-04-28 21:21:28,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,522 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884061495]
[2025-04-28 21:21:28,522 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,587 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-04-28 21:21:28,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-04-28 21:21:28,635 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,635 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:28,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,918 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884061495]
[2025-04-28 21:21:28,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884061495] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:28,918 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:28,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:28,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571278211]
[2025-04-28 21:21:28,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,919 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:28,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,920 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:28,920 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:28,920 INFO  L87              Difference]: Start difference. First operand 100 states and 103 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-04-28 21:21:28,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,987 INFO  L93              Difference]: Finished difference Result 107 states and 110 transitions.
[2025-04-28 21:21:28,988 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:28,988 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-04-28 21:21:28,989 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,989 INFO  L225             Difference]: With dead ends: 107
[2025-04-28 21:21:28,990 INFO  L226             Difference]: Without dead ends: 96
[2025-04-28 21:21:28,990 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-04-28 21:21:28,992 INFO  L437           NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 610 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,992 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 610 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:28,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-04-28 21:21:29,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2025-04-28 21:21:29,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 26 states have call successors, (27), 26 states have call predecessors, (27), 26 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27)
[2025-04-28 21:21:29,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions.
[2025-04-28 21:21:29,003 INFO  L79                 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 91
[2025-04-28 21:21:29,003 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:29,003 INFO  L485      AbstractCegarLoop]: Abstraction has 96 states and 97 transitions.
[2025-04-28 21:21:29,003 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-04-28 21:21:29,003 INFO  L278                IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions.
[2025-04-28 21:21:29,005 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-04-28 21:21:29,008 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:29,009 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-04-28 21:21:29,009 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:29,009 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:29,009 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:29,010 INFO  L85        PathProgramCache]: Analyzing trace with hash -1877190622, now seen corresponding path program 1 times
[2025-04-28 21:21:29,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:29,010 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324240950]
[2025-04-28 21:21:29,010 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:29,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-04-28 21:21:29,124 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-04-28 21:21:29,125 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:32,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,019 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324240950]
[2025-04-28 21:21:32,019 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324240950] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:32,019 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28
[2025-04-28 21:21:32,019 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342506159]
[2025-04-28 21:21:32,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,020 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-04-28 21:21:32,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,021 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-04-28 21:21:32,021 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:32,022 INFO  L87              Difference]: Start difference. First operand 96 states and 97 transitions. Second operand  has 28 states, 20 states have (on average 2.05) internal successors, (41), 23 states have internal predecessors, (41), 12 states have call successors, (25), 1 states have call predecessors, (25), 20 states have return successors, (25), 22 states have call predecessors, (25), 12 states have call successors, (25)
[2025-04-28 21:21:32,933 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,933 INFO  L93              Difference]: Finished difference Result 101 states and 102 transitions.
[2025-04-28 21:21:32,934 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2025-04-28 21:21:32,934 INFO  L79                 Accepts]: Start accepts. Automaton has  has 28 states, 20 states have (on average 2.05) internal successors, (41), 23 states have internal predecessors, (41), 12 states have call successors, (25), 1 states have call predecessors, (25), 20 states have return successors, (25), 22 states have call predecessors, (25), 12 states have call successors, (25) Word has length 91
[2025-04-28 21:21:32,934 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,935 INFO  L225             Difference]: With dead ends: 101
[2025-04-28 21:21:32,935 INFO  L226             Difference]: Without dead ends: 92
[2025-04-28 21:21:32,936 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122
[2025-04-28 21:21:32,937 INFO  L437           NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,937 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2089 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:21:32,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-04-28 21:21:32,941 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-04-28 21:21:32,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 41 states have (on average 1.0) internal successors, (41), 41 states have internal predecessors, (41), 25 states have call successors, (25), 25 states have call predecessors, (25), 25 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-04-28 21:21:32,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 91 transitions.
[2025-04-28 21:21:32,942 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 91 transitions. Word has length 91
[2025-04-28 21:21:32,943 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,943 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 91 transitions.
[2025-04-28 21:21:32,943 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 20 states have (on average 2.05) internal successors, (41), 23 states have internal predecessors, (41), 12 states have call successors, (25), 1 states have call predecessors, (25), 20 states have return successors, (25), 22 states have call predecessors, (25), 12 states have call successors, (25)
[2025-04-28 21:21:32,943 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 91 transitions.
[2025-04-28 21:21:32,944 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-04-28 21:21:32,944 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,944 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-04-28 21:21:32,945 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:32,945 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,945 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,945 INFO  L85        PathProgramCache]: Analyzing trace with hash -889755136, now seen corresponding path program 1 times
[2025-04-28 21:21:32,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,946 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520774162]
[2025-04-28 21:21:32,946 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,003 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-04-28 21:21:33,039 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-04-28 21:21:33,039 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:33,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,276 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520774162]
[2025-04-28 21:21:33,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520774162] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:33,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:33,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853851488]
[2025-04-28 21:21:33,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,277 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:33,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,277 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:33,278 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:33,279 INFO  L87              Difference]: Start difference. First operand 92 states and 91 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-04-28 21:21:33,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,335 INFO  L93              Difference]: Finished difference Result 86 states and 85 transitions.
[2025-04-28 21:21:33,336 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:33,336 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-04-28 21:21:33,337 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,337 INFO  L225             Difference]: With dead ends: 86
[2025-04-28 21:21:33,338 INFO  L226             Difference]: Without dead ends: 0
[2025-04-28 21:21:33,338 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-04-28 21:21:33,339 INFO  L437           NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 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-04-28 21:21:33,339 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:33,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-04-28 21:21:33,341 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-04-28 21:21:33,341 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-04-28 21:21:33,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-04-28 21:21:33,341 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91
[2025-04-28 21:21:33,341 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,341 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-04-28 21:21:33,342 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-04-28 21:21:33,342 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-04-28 21:21:33,342 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-04-28 21:21:33,349 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:33,350 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-04-28 21:21:33,354 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,357 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:33,361 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:33 BoogieIcfgContainer
[2025-04-28 21:21:33,361 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:33,363 INFO  L158              Benchmark]: Toolchain (without parser) took 9974.97ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 142.5MB in the beginning and 269.6MB in the end (delta: -127.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:33,363 INFO  L158              Benchmark]: SmtParser took 3.24ms. Allocated memory is still 234.9MB. Free memory is still 171.9MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:33,363 INFO  L158              Benchmark]: ChcToBoogie took 91.15ms. Allocated memory is still 234.9MB. Free memory was 142.5MB in the beginning and 139.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:33,364 INFO  L158              Benchmark]: Boogie Preprocessor took 127.39ms. Allocated memory is still 234.9MB. Free memory was 139.0MB in the beginning and 135.3MB in the end (delta: 3.7MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:33,364 INFO  L158              Benchmark]: RCFGBuilder took 977.83ms. Allocated memory is still 234.9MB. Free memory was 135.3MB in the beginning and 187.6MB in the end (delta: -52.3MB). Peak memory consumption was 61.6MB. Max. memory is 33.6GB.
[2025-04-28 21:21:33,364 INFO  L158              Benchmark]: TraceAbstraction took 8770.73ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 186.6MB in the beginning and 269.6MB in the end (delta: -83.0MB). Peak memory consumption was 36.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:33,366 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 3.24ms. Allocated memory is still 234.9MB. Free memory is still 171.9MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 91.15ms. Allocated memory is still 234.9MB. Free memory was 142.5MB in the beginning and 139.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 127.39ms. Allocated memory is still 234.9MB. Free memory was 139.0MB in the beginning and 135.3MB in the end (delta: 3.7MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * RCFGBuilder took 977.83ms. Allocated memory is still 234.9MB. Free memory was 135.3MB in the beginning and 187.6MB in the end (delta: -52.3MB). Peak memory consumption was 61.6MB. Max. memory is 33.6GB.
 * TraceAbstraction took 8770.73ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 186.6MB in the beginning and 269.6MB in the end (delta: -83.0MB). Peak memory consumption was 36.8MB. 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 29 procedures, 121 locations, 193 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 6575 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5420 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1155 mSDtfsCounter, 669 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=0, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 750 ConstructedInterpolants, 0 QuantifiedInterpolants, 1074 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-04-28 21:21:33,386 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
