./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:24:11,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:24:11,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:24:11,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:24:11,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:24:11,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:24:11,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:24:11,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:24:11,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:24:11,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:24:11,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:24:11,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:24:11,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:24:11,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:24:11,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:24:11,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:24:11,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:24:11,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:24:11,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:24:11,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:24:11,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:24:11,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:24:11,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:24:11,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:24:11,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:24:11,899 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c [2025-03-03 16:24:12,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:24:12,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:24:12,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:24:12,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:24:12,191 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:24:12,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c [2025-03-03 16:24:13,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4731b0658/8ef6b72751464f8e82f1a4addf42a518/FLAG3d34a5728 [2025-03-03 16:24:13,653 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:24:13,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c [2025-03-03 16:24:13,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4731b0658/8ef6b72751464f8e82f1a4addf42a518/FLAG3d34a5728 [2025-03-03 16:24:13,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4731b0658/8ef6b72751464f8e82f1a4addf42a518 [2025-03-03 16:24:13,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:24:13,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:24:13,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:24:13,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:24:13,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:24:13,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:24:13" (1/1) ... [2025-03-03 16:24:13,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e41fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:13, skipping insertion in model container [2025-03-03 16:24:13,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:24:13" (1/1) ... [2025-03-03 16:24:13,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:24:14,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c[911,924] [2025-03-03 16:24:14,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c[8416,8429] [2025-03-03 16:24:14,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:24:14,171 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:24:14,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c[911,924] [2025-03-03 16:24:14,199 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c[8416,8429] [2025-03-03 16:24:14,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:24:14,260 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:24:14,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14 WrapperNode [2025-03-03 16:24:14,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:24:14,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:24:14,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:24:14,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:24:14,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,310 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 992 [2025-03-03 16:24:14,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:24:14,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:24:14,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:24:14,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:24:14,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:24:14,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:24:14,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:24:14,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:24:14,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:24:14,356 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (1/1) ... [2025-03-03 16:24:14,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:24:14,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:24:14,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:24:14,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:24:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:24:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:24:14,410 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:24:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:24:14,410 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:24:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:24:14,410 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:24:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:24:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:24:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:24:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:24:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:24:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:24:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:24:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:24:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:24:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:24:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:24:14,412 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:24:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:24:14,412 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:24:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:24:14,412 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:24:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:24:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:24:14,413 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:24:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:24:14,413 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:24:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:24:14,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:24:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:24:14,413 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:24:14,503 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:24:14,505 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:24:15,114 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-03 16:24:15,114 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-03 16:24:15,114 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-03 16:24:15,283 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-03 16:24:15,283 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:24:15,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:24:15,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:24:15,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:24:15 BoogieIcfgContainer [2025-03-03 16:24:15,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:24:15,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:24:15,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:24:15,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:24:15,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:24:13" (1/3) ... [2025-03-03 16:24:15,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc06e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:24:15, skipping insertion in model container [2025-03-03 16:24:15,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:14" (2/3) ... [2025-03-03 16:24:15,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc06e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:24:15, skipping insertion in model container [2025-03-03 16:24:15,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:24:15" (3/3) ... [2025-03-03 16:24:15,314 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-2.c [2025-03-03 16:24:15,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:24:15,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.11.cil-2.c that has 15 procedures, 500 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-03-03 16:24:15,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:24:15,403 INFO L333 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=LoopHeads, 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;@1b8dbe46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:24:15,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:24:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 500 states, 442 states have (on average 1.5565610859728507) internal successors, (688), 448 states have internal predecessors, (688), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 16:24:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:15,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:15,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:15,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:15,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1520720338, now seen corresponding path program 1 times [2025-03-03 16:24:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674671777] [2025-03-03 16:24:15,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:15,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:15,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:15,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:15,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674671777] [2025-03-03 16:24:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674671777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111129034] [2025-03-03 16:24:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:15,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:15,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:15,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:15,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:15,861 INFO L87 Difference]: Start difference. First operand has 500 states, 442 states have (on average 1.5565610859728507) internal successors, (688), 448 states have internal predecessors, (688), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:16,639 INFO L93 Difference]: Finished difference Result 1094 states and 1679 transitions. [2025-03-03 16:24:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:16,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:24:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:16,660 INFO L225 Difference]: With dead ends: 1094 [2025-03-03 16:24:16,660 INFO L226 Difference]: Without dead ends: 611 [2025-03-03 16:24:16,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:16,667 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 502 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:16,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1621 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-03 16:24:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 604. [2025-03-03 16:24:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 526 states have (on average 1.4961977186311788) internal successors, (787), 532 states have internal predecessors, (787), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2025-03-03 16:24:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 898 transitions. [2025-03-03 16:24:16,747 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 898 transitions. Word has length 65 [2025-03-03 16:24:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:16,748 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 898 transitions. [2025-03-03 16:24:16,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 898 transitions. [2025-03-03 16:24:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:16,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:16,750 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] [2025-03-03 16:24:16,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:24:16,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:16,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash 212681010, now seen corresponding path program 1 times [2025-03-03 16:24:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659523165] [2025-03-03 16:24:16,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:16,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:16,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:16,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:16,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659523165] [2025-03-03 16:24:16,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659523165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:16,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773675056] [2025-03-03 16:24:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:16,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:16,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:16,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:16,938 INFO L87 Difference]: Start difference. First operand 604 states and 898 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:17,755 INFO L93 Difference]: Finished difference Result 977 states and 1419 transitions. [2025-03-03 16:24:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:17,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:24:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:17,760 INFO L225 Difference]: With dead ends: 977 [2025-03-03 16:24:17,760 INFO L226 Difference]: Without dead ends: 764 [2025-03-03 16:24:17,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:17,761 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 1058 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:17,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1900 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-03 16:24:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 718. [2025-03-03 16:24:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 618 states have (on average 1.4805825242718447) internal successors, (915), 626 states have internal predecessors, (915), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2025-03-03 16:24:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1060 transitions. [2025-03-03 16:24:17,804 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1060 transitions. Word has length 65 [2025-03-03 16:24:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:17,805 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1060 transitions. [2025-03-03 16:24:17,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1060 transitions. [2025-03-03 16:24:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:17,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:17,808 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] [2025-03-03 16:24:17,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:24:17,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1345871603, now seen corresponding path program 1 times [2025-03-03 16:24:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756519347] [2025-03-03 16:24:17,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:17,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:17,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:17,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756519347] [2025-03-03 16:24:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756519347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:17,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:17,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:24:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496019393] [2025-03-03 16:24:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:17,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:24:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:17,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:24:17,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:24:17,929 INFO L87 Difference]: Start difference. First operand 718 states and 1060 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:24:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:19,043 INFO L93 Difference]: Finished difference Result 2180 states and 3124 transitions. [2025-03-03 16:24:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:19,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2025-03-03 16:24:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:19,051 INFO L225 Difference]: With dead ends: 2180 [2025-03-03 16:24:19,051 INFO L226 Difference]: Without dead ends: 1841 [2025-03-03 16:24:19,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:24:19,054 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 3298 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3316 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:19,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3316 Valid, 2127 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:19,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-03-03 16:24:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1788. [2025-03-03 16:24:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1483 states have (on average 1.399865138233311) internal successors, (2076), 1506 states have internal predecessors, (2076), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2025-03-03 16:24:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2464 transitions. [2025-03-03 16:24:19,163 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2464 transitions. Word has length 65 [2025-03-03 16:24:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:19,164 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2464 transitions. [2025-03-03 16:24:19,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:24:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2464 transitions. [2025-03-03 16:24:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:24:19,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:19,165 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-03-03 16:24:19,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:24:19,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:19,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2015623797, now seen corresponding path program 1 times [2025-03-03 16:24:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082831354] [2025-03-03 16:24:19,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:19,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:24:19,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:24:19,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:19,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:19,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:19,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082831354] [2025-03-03 16:24:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082831354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673962842] [2025-03-03 16:24:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:19,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:19,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:19,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:19,240 INFO L87 Difference]: Start difference. First operand 1788 states and 2464 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:24:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:19,323 INFO L93 Difference]: Finished difference Result 3231 states and 4412 transitions. [2025-03-03 16:24:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 16:24:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:19,331 INFO L225 Difference]: With dead ends: 3231 [2025-03-03 16:24:19,331 INFO L226 Difference]: Without dead ends: 1828 [2025-03-03 16:24:19,335 INFO L434 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-03-03 16:24:19,335 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 0 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:19,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3669 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2025-03-03 16:24:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1828. [2025-03-03 16:24:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1515 states have (on average 1.3874587458745875) internal successors, (2102), 1538 states have internal predecessors, (2102), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2025-03-03 16:24:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2498 transitions. [2025-03-03 16:24:19,428 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2498 transitions. Word has length 66 [2025-03-03 16:24:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:19,428 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2498 transitions. [2025-03-03 16:24:19,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:24:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2498 transitions. [2025-03-03 16:24:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:24:19,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:19,430 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-03-03 16:24:19,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:24:19,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:19,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash -382819798, now seen corresponding path program 1 times [2025-03-03 16:24:19,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953449845] [2025-03-03 16:24:19,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:19,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:24:19,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:24:19,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:19,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:19,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953449845] [2025-03-03 16:24:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953449845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:19,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:24:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447509824] [2025-03-03 16:24:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:19,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:24:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:19,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:24:19,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:24:19,522 INFO L87 Difference]: Start difference. First operand 1828 states and 2498 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:24:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:20,703 INFO L93 Difference]: Finished difference Result 5264 states and 7132 transitions. [2025-03-03 16:24:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:20,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2025-03-03 16:24:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:20,714 INFO L225 Difference]: With dead ends: 5264 [2025-03-03 16:24:20,714 INFO L226 Difference]: Without dead ends: 2094 [2025-03-03 16:24:20,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:24:20,721 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 3379 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3397 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:20,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3397 Valid, 2156 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2025-03-03 16:24:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2024. [2025-03-03 16:24:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1639 states have (on average 1.3502135448444172) internal successors, (2213), 1664 states have internal predecessors, (2213), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2025-03-03 16:24:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2695 transitions. [2025-03-03 16:24:20,828 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2695 transitions. Word has length 66 [2025-03-03 16:24:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:20,829 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 2695 transitions. [2025-03-03 16:24:20,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:24:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2695 transitions. [2025-03-03 16:24:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:20,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:20,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:20,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:24:20,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:20,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash 296862057, now seen corresponding path program 1 times [2025-03-03 16:24:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:20,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784933448] [2025-03-03 16:24:20,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:20,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:20,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:20,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:20,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:20,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784933448] [2025-03-03 16:24:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784933448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367228682] [2025-03-03 16:24:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:20,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:20,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:20,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:20,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:20,906 INFO L87 Difference]: Start difference. First operand 2024 states and 2695 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:24:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:21,008 INFO L93 Difference]: Finished difference Result 3723 states and 4906 transitions. [2025-03-03 16:24:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2025-03-03 16:24:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:21,018 INFO L225 Difference]: With dead ends: 3723 [2025-03-03 16:24:21,018 INFO L226 Difference]: Without dead ends: 2084 [2025-03-03 16:24:21,021 INFO L434 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-03-03 16:24:21,022 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 0 mSDsluCounter, 2895 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:21,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3620 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2025-03-03 16:24:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2084. [2025-03-03 16:24:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1687 states have (on average 1.3366923532898636) internal successors, (2255), 1712 states have internal predecessors, (2255), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2025-03-03 16:24:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2749 transitions. [2025-03-03 16:24:21,120 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2749 transitions. Word has length 92 [2025-03-03 16:24:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:21,120 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 2749 transitions. [2025-03-03 16:24:21,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:24:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2749 transitions. [2025-03-03 16:24:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:21,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:21,121 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:21,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:24:21,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:21,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash 734871560, now seen corresponding path program 1 times [2025-03-03 16:24:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:21,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328456254] [2025-03-03 16:24:21,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:21,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:21,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:21,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:21,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328456254] [2025-03-03 16:24:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328456254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:21,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:21,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175421843] [2025-03-03 16:24:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:21,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:21,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:21,260 INFO L87 Difference]: Start difference. First operand 2084 states and 2749 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:22,032 INFO L93 Difference]: Finished difference Result 3532 states and 4588 transitions. [2025-03-03 16:24:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:24:22,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2025-03-03 16:24:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:22,043 INFO L225 Difference]: With dead ends: 3532 [2025-03-03 16:24:22,043 INFO L226 Difference]: Without dead ends: 2072 [2025-03-03 16:24:22,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:24:22,048 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 1057 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:22,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1643 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2025-03-03 16:24:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1862. [2025-03-03 16:24:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1518 states have (on average 1.3412384716732544) internal successors, (2036), 1538 states have internal predecessors, (2036), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2025-03-03 16:24:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2462 transitions. [2025-03-03 16:24:22,138 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2462 transitions. Word has length 92 [2025-03-03 16:24:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:22,138 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2462 transitions. [2025-03-03 16:24:22,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2462 transitions. [2025-03-03 16:24:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:22,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:22,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:22,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:24:22,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:22,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 727112201, now seen corresponding path program 1 times [2025-03-03 16:24:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129515889] [2025-03-03 16:24:22,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:22,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:22,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:22,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:22,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:24:22,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:22,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129515889] [2025-03-03 16:24:22,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129515889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:22,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:22,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:24:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424801688] [2025-03-03 16:24:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:22,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:24:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:22,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:24:22,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:24:22,196 INFO L87 Difference]: Start difference. First operand 1862 states and 2462 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:24:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:22,738 INFO L93 Difference]: Finished difference Result 4814 states and 6292 transitions. [2025-03-03 16:24:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:24:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2025-03-03 16:24:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:22,754 INFO L225 Difference]: With dead ends: 4814 [2025-03-03 16:24:22,755 INFO L226 Difference]: Without dead ends: 3338 [2025-03-03 16:24:22,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:22,759 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 984 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:22,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 830 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:24:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-03-03 16:24:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3338. [2025-03-03 16:24:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 2674 states have (on average 1.2980553477935677) internal successors, (3471), 2723 states have internal predecessors, (3471), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2025-03-03 16:24:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 4341 transitions. [2025-03-03 16:24:22,951 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 4341 transitions. Word has length 92 [2025-03-03 16:24:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:22,952 INFO L471 AbstractCegarLoop]: Abstraction has 3338 states and 4341 transitions. [2025-03-03 16:24:22,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:24:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4341 transitions. [2025-03-03 16:24:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:22,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:22,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:22,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:24:22,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:22,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1510491176, now seen corresponding path program 1 times [2025-03-03 16:24:22,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:22,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067407112] [2025-03-03 16:24:22,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:22,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:22,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:22,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:22,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067407112] [2025-03-03 16:24:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067407112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:24:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34610958] [2025-03-03 16:24:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:22,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:22,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:22,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:22,984 INFO L87 Difference]: Start difference. First operand 3338 states and 4341 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:23,040 INFO L93 Difference]: Finished difference Result 4814 states and 6172 transitions. [2025-03-03 16:24:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:23,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2025-03-03 16:24:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:23,050 INFO L225 Difference]: With dead ends: 4814 [2025-03-03 16:24:23,050 INFO L226 Difference]: Without dead ends: 1862 [2025-03-03 16:24:23,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:23,056 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 141 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1302 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-03-03 16:24:23,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1302 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-03-03 16:24:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2025-03-03 16:24:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1518 states have (on average 1.3168642951251648) internal successors, (1999), 1538 states have internal predecessors, (1999), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2025-03-03 16:24:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2425 transitions. [2025-03-03 16:24:23,141 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2425 transitions. Word has length 92 [2025-03-03 16:24:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:23,141 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2425 transitions. [2025-03-03 16:24:23,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2425 transitions. [2025-03-03 16:24:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:24:23,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:23,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:23,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:24:23,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:23,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:23,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1404887804, now seen corresponding path program 1 times [2025-03-03 16:24:23,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:23,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312010349] [2025-03-03 16:24:23,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:23,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:23,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:24:23,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:24:23,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:23,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:24:23,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:23,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312010349] [2025-03-03 16:24:23,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312010349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:23,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:23,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:24:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656085152] [2025-03-03 16:24:23,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:23,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:24:23,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:23,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:24:23,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:24:23,224 INFO L87 Difference]: Start difference. First operand 1862 states and 2425 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:24:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:24,294 INFO L93 Difference]: Finished difference Result 4211 states and 5406 transitions. [2025-03-03 16:24:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:24,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2025-03-03 16:24:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:24,305 INFO L225 Difference]: With dead ends: 4211 [2025-03-03 16:24:24,305 INFO L226 Difference]: Without dead ends: 2584 [2025-03-03 16:24:24,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:24:24,309 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 1710 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:24,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 2170 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2025-03-03 16:24:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2463. [2025-03-03 16:24:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 1973 states have (on average 1.281297516472377) internal successors, (2528), 2002 states have internal predecessors, (2528), 260 states have call successors, (260), 170 states have call predecessors, (260), 228 states have return successors, (342), 292 states have call predecessors, (342), 258 states have call successors, (342) [2025-03-03 16:24:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3130 transitions. [2025-03-03 16:24:24,426 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3130 transitions. Word has length 93 [2025-03-03 16:24:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 2463 states and 3130 transitions. [2025-03-03 16:24:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:24:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3130 transitions. [2025-03-03 16:24:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:24:24,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:24,428 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:24,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:24:24,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:24,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash -53327256, now seen corresponding path program 1 times [2025-03-03 16:24:24,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:24,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30494922] [2025-03-03 16:24:24,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:24,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:24,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:24:24,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:24:24,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:24,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 16:24:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30494922] [2025-03-03 16:24:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30494922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:24:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805089532] [2025-03-03 16:24:24,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:24,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:24:24,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:24:24,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:24:24,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:24:24,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:24:24,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:24:24,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:24,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:24,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:24:24,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:24:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 16:24:24,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:24:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805089532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:24,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:24:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 16:24:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288920631] [2025-03-03 16:24:24,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:24,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:24,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:24,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:24:24,779 INFO L87 Difference]: Start difference. First operand 2463 states and 3130 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:24:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:25,047 INFO L93 Difference]: Finished difference Result 6392 states and 7927 transitions. [2025-03-03 16:24:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:25,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-03 16:24:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:25,070 INFO L225 Difference]: With dead ends: 6392 [2025-03-03 16:24:25,070 INFO L226 Difference]: Without dead ends: 4392 [2025-03-03 16:24:25,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:24:25,076 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 61 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:25,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1430 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2025-03-03 16:24:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 4360. [2025-03-03 16:24:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4360 states, 3453 states have (on average 1.2479003764842167) internal successors, (4309), 3507 states have internal predecessors, (4309), 467 states have call successors, (467), 333 states have call predecessors, (467), 438 states have return successors, (605), 521 states have call predecessors, (605), 465 states have call successors, (605) [2025-03-03 16:24:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 5381 transitions. [2025-03-03 16:24:25,338 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 5381 transitions. Word has length 164 [2025-03-03 16:24:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:25,338 INFO L471 AbstractCegarLoop]: Abstraction has 4360 states and 5381 transitions. [2025-03-03 16:24:25,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:24:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 5381 transitions. [2025-03-03 16:24:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:25,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:25,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:25,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:24:25,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 16:24:25,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:25,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1830070079, now seen corresponding path program 1 times [2025-03-03 16:24:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:25,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350027202] [2025-03-03 16:24:25,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:25,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:25,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:25,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:25,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:25,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:25,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350027202] [2025-03-03 16:24:25,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350027202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:25,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:25,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:25,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017305472] [2025-03-03 16:24:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:25,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:25,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:25,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:25,646 INFO L87 Difference]: Start difference. First operand 4360 states and 5381 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:26,344 INFO L93 Difference]: Finished difference Result 5118 states and 6561 transitions. [2025-03-03 16:24:26,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:26,364 INFO L225 Difference]: With dead ends: 5118 [2025-03-03 16:24:26,365 INFO L226 Difference]: Without dead ends: 4761 [2025-03-03 16:24:26,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:26,367 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 1275 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:26,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 1819 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:24:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2025-03-03 16:24:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4734. [2025-03-03 16:24:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 3800 states have (on average 1.2757894736842106) internal successors, (4848), 3855 states have internal predecessors, (4848), 487 states have call successors, (487), 339 states have call predecessors, (487), 445 states have return successors, (626), 541 states have call predecessors, (626), 485 states have call successors, (626) [2025-03-03 16:24:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 5961 transitions. [2025-03-03 16:24:26,573 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 5961 transitions. Word has length 167 [2025-03-03 16:24:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:26,573 INFO L471 AbstractCegarLoop]: Abstraction has 4734 states and 5961 transitions. [2025-03-03 16:24:26,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 5961 transitions. [2025-03-03 16:24:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:26,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:26,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:26,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:24:26,576 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:26,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1965104127, now seen corresponding path program 1 times [2025-03-03 16:24:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62068118] [2025-03-03 16:24:26,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:26,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:26,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:26,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:26,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:26,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62068118] [2025-03-03 16:24:26,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62068118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:26,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:26,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:26,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743356753] [2025-03-03 16:24:26,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:26,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:26,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:26,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:26,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:26,749 INFO L87 Difference]: Start difference. First operand 4734 states and 5961 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:27,697 INFO L93 Difference]: Finished difference Result 5937 states and 7854 transitions. [2025-03-03 16:24:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:27,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:27,713 INFO L225 Difference]: With dead ends: 5937 [2025-03-03 16:24:27,713 INFO L226 Difference]: Without dead ends: 5206 [2025-03-03 16:24:27,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:27,715 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 1283 mSDsluCounter, 2570 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 3417 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:27,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 3417 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2025-03-03 16:24:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5083. [2025-03-03 16:24:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5083 states, 4122 states have (on average 1.294759825327511) internal successors, (5337), 4178 states have internal predecessors, (5337), 507 states have call successors, (507), 345 states have call predecessors, (507), 452 states have return successors, (649), 562 states have call predecessors, (649), 505 states have call successors, (649) [2025-03-03 16:24:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 6493 transitions. [2025-03-03 16:24:27,976 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 6493 transitions. Word has length 167 [2025-03-03 16:24:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:27,976 INFO L471 AbstractCegarLoop]: Abstraction has 5083 states and 6493 transitions. [2025-03-03 16:24:27,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 6493 transitions. [2025-03-03 16:24:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:27,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:27,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:27,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:24:27,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:27,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1795960352, now seen corresponding path program 1 times [2025-03-03 16:24:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895840659] [2025-03-03 16:24:27,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:27,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:27,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:27,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:27,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895840659] [2025-03-03 16:24:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895840659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:28,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394410938] [2025-03-03 16:24:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:28,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:28,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:28,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:28,105 INFO L87 Difference]: Start difference. First operand 5083 states and 6493 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:29,001 INFO L93 Difference]: Finished difference Result 7048 states and 9577 transitions. [2025-03-03 16:24:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:29,018 INFO L225 Difference]: With dead ends: 7048 [2025-03-03 16:24:29,018 INFO L226 Difference]: Without dead ends: 5968 [2025-03-03 16:24:29,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:29,021 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 1278 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 3401 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:29,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 3401 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2025-03-03 16:24:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 5826. [2025-03-03 16:24:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5826 states, 4809 states have (on average 1.3304221251819506) internal successors, (6398), 4869 states have internal predecessors, (6398), 547 states have call successors, (547), 357 states have call predecessors, (547), 468 states have return successors, (701), 604 states have call predecessors, (701), 545 states have call successors, (701) [2025-03-03 16:24:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 7646 transitions. [2025-03-03 16:24:29,397 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 7646 transitions. Word has length 167 [2025-03-03 16:24:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:29,397 INFO L471 AbstractCegarLoop]: Abstraction has 5826 states and 7646 transitions. [2025-03-03 16:24:29,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 7646 transitions. [2025-03-03 16:24:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:29,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:29,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:29,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:24:29,401 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:29,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash 564800545, now seen corresponding path program 1 times [2025-03-03 16:24:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897123813] [2025-03-03 16:24:29,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:29,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:29,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:29,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:29,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:29,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897123813] [2025-03-03 16:24:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897123813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:29,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:29,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981064675] [2025-03-03 16:24:29,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:29,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:29,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:29,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:29,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:29,546 INFO L87 Difference]: Start difference. First operand 5826 states and 7646 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:30,476 INFO L93 Difference]: Finished difference Result 9445 states and 13376 transitions. [2025-03-03 16:24:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:30,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:30,497 INFO L225 Difference]: With dead ends: 9445 [2025-03-03 16:24:30,497 INFO L226 Difference]: Without dead ends: 7622 [2025-03-03 16:24:30,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:30,502 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 1273 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:30,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 3389 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7622 states. [2025-03-03 16:24:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7622 to 7441. [2025-03-03 16:24:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7441 states, 6306 states have (on average 1.3888360291785602) internal successors, (8758), 6380 states have internal predecessors, (8758), 627 states have call successors, (627), 381 states have call predecessors, (627), 506 states have return successors, (829), 688 states have call predecessors, (829), 625 states have call successors, (829) [2025-03-03 16:24:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 10214 transitions. [2025-03-03 16:24:30,825 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 10214 transitions. Word has length 167 [2025-03-03 16:24:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:30,827 INFO L471 AbstractCegarLoop]: Abstraction has 7441 states and 10214 transitions. [2025-03-03 16:24:30,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 10214 transitions. [2025-03-03 16:24:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:30,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:30,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:30,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:24:30,830 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:30,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:30,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1852897856, now seen corresponding path program 1 times [2025-03-03 16:24:30,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:30,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245905255] [2025-03-03 16:24:30,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:30,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:30,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:30,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:30,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:30,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:30,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245905255] [2025-03-03 16:24:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245905255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:30,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406914503] [2025-03-03 16:24:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:30,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:30,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:30,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:30,949 INFO L87 Difference]: Start difference. First operand 7441 states and 10214 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:31,911 INFO L93 Difference]: Finished difference Result 14736 states and 22010 transitions. [2025-03-03 16:24:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:31,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:31,941 INFO L225 Difference]: With dead ends: 14736 [2025-03-03 16:24:31,941 INFO L226 Difference]: Without dead ends: 11298 [2025-03-03 16:24:31,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:31,951 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 1268 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:31,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 3377 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11298 states. [2025-03-03 16:24:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11298 to 11040. [2025-03-03 16:24:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 9651 states have (on average 1.4669982385245053) internal successors, (14158), 9771 states have internal predecessors, (14158), 787 states have call successors, (787), 429 states have call predecessors, (787), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-03 16:24:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 16126 transitions. [2025-03-03 16:24:32,522 INFO L78 Accepts]: Start accepts. Automaton has 11040 states and 16126 transitions. Word has length 167 [2025-03-03 16:24:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:32,522 INFO L471 AbstractCegarLoop]: Abstraction has 11040 states and 16126 transitions. [2025-03-03 16:24:32,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 11040 states and 16126 transitions. [2025-03-03 16:24:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:32,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:32,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:32,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:24:32,528 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:32,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1930888127, now seen corresponding path program 1 times [2025-03-03 16:24:32,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:32,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813231005] [2025-03-03 16:24:32,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:32,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:32,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:32,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:32,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:32,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:32,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813231005] [2025-03-03 16:24:32,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813231005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:32,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:32,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:32,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820382374] [2025-03-03 16:24:32,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:32,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:32,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:32,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:32,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:32,671 INFO L87 Difference]: Start difference. First operand 11040 states and 16126 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:33,607 INFO L93 Difference]: Finished difference Result 19737 states and 30779 transitions. [2025-03-03 16:24:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:33,642 INFO L225 Difference]: With dead ends: 19737 [2025-03-03 16:24:33,642 INFO L226 Difference]: Without dead ends: 12700 [2025-03-03 16:24:33,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:33,657 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 959 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:33,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1357 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:24:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12700 states. [2025-03-03 16:24:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12700 to 11040. [2025-03-03 16:24:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 9651 states have (on average 1.4652367630297378) internal successors, (14141), 9771 states have internal predecessors, (14141), 787 states have call successors, (787), 429 states have call predecessors, (787), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-03 16:24:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 16109 transitions. [2025-03-03 16:24:34,092 INFO L78 Accepts]: Start accepts. Automaton has 11040 states and 16109 transitions. Word has length 167 [2025-03-03 16:24:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:34,092 INFO L471 AbstractCegarLoop]: Abstraction has 11040 states and 16109 transitions. [2025-03-03 16:24:34,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11040 states and 16109 transitions. [2025-03-03 16:24:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:34,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:34,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:34,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:24:34,097 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:34,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 421900704, now seen corresponding path program 1 times [2025-03-03 16:24:34,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:34,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683424478] [2025-03-03 16:24:34,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:34,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:34,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:34,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:34,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:34,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:34,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683424478] [2025-03-03 16:24:34,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683424478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:34,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:34,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:34,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665432977] [2025-03-03 16:24:34,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:34,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:34,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:34,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:34,194 INFO L87 Difference]: Start difference. First operand 11040 states and 16109 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:34,974 INFO L93 Difference]: Finished difference Result 19654 states and 30579 transitions. [2025-03-03 16:24:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:34,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:35,017 INFO L225 Difference]: With dead ends: 19654 [2025-03-03 16:24:35,017 INFO L226 Difference]: Without dead ends: 12617 [2025-03-03 16:24:35,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:35,037 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 956 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:35,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 1349 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:24:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12617 states. [2025-03-03 16:24:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12617 to 11040. [2025-03-03 16:24:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 9651 states have (on average 1.4634752875349704) internal successors, (14124), 9771 states have internal predecessors, (14124), 787 states have call successors, (787), 429 states have call predecessors, (787), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-03 16:24:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 16092 transitions. [2025-03-03 16:24:35,531 INFO L78 Accepts]: Start accepts. Automaton has 11040 states and 16092 transitions. Word has length 167 [2025-03-03 16:24:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:35,531 INFO L471 AbstractCegarLoop]: Abstraction has 11040 states and 16092 transitions. [2025-03-03 16:24:35,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 11040 states and 16092 transitions. [2025-03-03 16:24:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:35,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:35,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:24:35,535 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:35,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash -472034207, now seen corresponding path program 1 times [2025-03-03 16:24:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574256943] [2025-03-03 16:24:35,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:35,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:35,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:35,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:35,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574256943] [2025-03-03 16:24:35,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574256943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:35,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:35,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928083372] [2025-03-03 16:24:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:35,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:35,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:35,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:35,615 INFO L87 Difference]: Start difference. First operand 11040 states and 16092 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:36,593 INFO L93 Difference]: Finished difference Result 19571 states and 30379 transitions. [2025-03-03 16:24:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:36,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:36,631 INFO L225 Difference]: With dead ends: 19571 [2025-03-03 16:24:36,631 INFO L226 Difference]: Without dead ends: 12534 [2025-03-03 16:24:36,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:36,647 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 953 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:36,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1341 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:24:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12534 states. [2025-03-03 16:24:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12534 to 11040. [2025-03-03 16:24:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 9651 states have (on average 1.4617138120402031) internal successors, (14107), 9771 states have internal predecessors, (14107), 787 states have call successors, (787), 429 states have call predecessors, (787), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-03 16:24:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 16075 transitions. [2025-03-03 16:24:37,316 INFO L78 Accepts]: Start accepts. Automaton has 11040 states and 16075 transitions. Word has length 167 [2025-03-03 16:24:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:37,316 INFO L471 AbstractCegarLoop]: Abstraction has 11040 states and 16075 transitions. [2025-03-03 16:24:37,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 11040 states and 16075 transitions. [2025-03-03 16:24:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:37,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:37,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:37,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:24:37,320 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:37,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash 607507840, now seen corresponding path program 1 times [2025-03-03 16:24:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689873568] [2025-03-03 16:24:37,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:37,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:37,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:37,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:37,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689873568] [2025-03-03 16:24:37,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689873568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:37,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:37,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364508524] [2025-03-03 16:24:37,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:37,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:37,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:37,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:37,406 INFO L87 Difference]: Start difference. First operand 11040 states and 16075 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:38,629 INFO L93 Difference]: Finished difference Result 26435 states and 41611 transitions. [2025-03-03 16:24:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:38,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:38,687 INFO L225 Difference]: With dead ends: 26435 [2025-03-03 16:24:38,687 INFO L226 Difference]: Without dead ends: 19398 [2025-03-03 16:24:38,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:38,709 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 1239 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 3308 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:38,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 3308 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19398 states. [2025-03-03 16:24:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19398 to 19048. [2025-03-03 16:24:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19048 states, 17097 states have (on average 1.5388079780078376) internal successors, (26309), 17363 states have internal predecessors, (26309), 1107 states have call successors, (1107), 525 states have call predecessors, (1107), 842 states have return successors, (2269), 1192 states have call predecessors, (2269), 1105 states have call successors, (2269) [2025-03-03 16:24:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19048 states to 19048 states and 29685 transitions. [2025-03-03 16:24:39,490 INFO L78 Accepts]: Start accepts. Automaton has 19048 states and 29685 transitions. Word has length 167 [2025-03-03 16:24:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:39,491 INFO L471 AbstractCegarLoop]: Abstraction has 19048 states and 29685 transitions. [2025-03-03 16:24:39,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 19048 states and 29685 transitions. [2025-03-03 16:24:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:39,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:39,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:39,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:24:39,496 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 642331777, now seen corresponding path program 1 times [2025-03-03 16:24:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046661467] [2025-03-03 16:24:39,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:39,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:39,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:39,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:39,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046661467] [2025-03-03 16:24:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046661467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:39,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550375421] [2025-03-03 16:24:39,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:39,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:39,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:39,562 INFO L87 Difference]: Start difference. First operand 19048 states and 29685 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:40,634 INFO L93 Difference]: Finished difference Result 38013 states and 62731 transitions. [2025-03-03 16:24:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:40,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:40,697 INFO L225 Difference]: With dead ends: 38013 [2025-03-03 16:24:40,697 INFO L226 Difference]: Without dead ends: 22968 [2025-03-03 16:24:40,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:40,728 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 949 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:40,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1327 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:24:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22968 states. [2025-03-03 16:24:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22968 to 19048. [2025-03-03 16:24:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19048 states, 17097 states have (on average 1.5368778148213136) internal successors, (26276), 17363 states have internal predecessors, (26276), 1107 states have call successors, (1107), 525 states have call predecessors, (1107), 842 states have return successors, (2269), 1192 states have call predecessors, (2269), 1105 states have call successors, (2269) [2025-03-03 16:24:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19048 states to 19048 states and 29652 transitions. [2025-03-03 16:24:41,890 INFO L78 Accepts]: Start accepts. Automaton has 19048 states and 29652 transitions. Word has length 167 [2025-03-03 16:24:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:41,890 INFO L471 AbstractCegarLoop]: Abstraction has 19048 states and 29652 transitions. [2025-03-03 16:24:41,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 19048 states and 29652 transitions. [2025-03-03 16:24:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:41,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:41,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:41,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:24:41,896 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:41,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1296207520, now seen corresponding path program 1 times [2025-03-03 16:24:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:41,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064216513] [2025-03-03 16:24:41,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:41,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:41,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:41,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:41,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064216513] [2025-03-03 16:24:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064216513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:42,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:42,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697164626] [2025-03-03 16:24:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:42,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:42,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:42,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:42,018 INFO L87 Difference]: Start difference. First operand 19048 states and 29652 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:43,814 INFO L93 Difference]: Finished difference Result 52929 states and 88316 transitions. [2025-03-03 16:24:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:43,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:43,928 INFO L225 Difference]: With dead ends: 52929 [2025-03-03 16:24:43,929 INFO L226 Difference]: Without dead ends: 37884 [2025-03-03 16:24:43,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:43,974 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 1226 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:43,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 3277 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37884 states. [2025-03-03 16:24:45,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37884 to 37332. [2025-03-03 16:24:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37332 states, 34095 states have (on average 1.6038128757882388) internal successors, (54682), 34815 states have internal predecessors, (54682), 1747 states have call successors, (1747), 717 states have call predecessors, (1747), 1488 states have return successors, (5981), 1864 states have call predecessors, (5981), 1745 states have call successors, (5981) [2025-03-03 16:24:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37332 states to 37332 states and 62410 transitions. [2025-03-03 16:24:45,381 INFO L78 Accepts]: Start accepts. Automaton has 37332 states and 62410 transitions. Word has length 167 [2025-03-03 16:24:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:45,381 INFO L471 AbstractCegarLoop]: Abstraction has 37332 states and 62410 transitions. [2025-03-03 16:24:45,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 37332 states and 62410 transitions. [2025-03-03 16:24:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:45,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:45,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:45,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:24:45,389 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:45,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1550752929, now seen corresponding path program 1 times [2025-03-03 16:24:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645454749] [2025-03-03 16:24:45,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:45,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:45,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:45,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:45,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:45,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645454749] [2025-03-03 16:24:45,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645454749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:45,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:45,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:45,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464428030] [2025-03-03 16:24:45,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:45,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:45,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:45,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:45,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:45,474 INFO L87 Difference]: Start difference. First operand 37332 states and 62410 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:48,691 INFO L93 Difference]: Finished difference Result 114755 states and 205192 transitions. [2025-03-03 16:24:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:24:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:48,995 INFO L225 Difference]: With dead ends: 114755 [2025-03-03 16:24:48,995 INFO L226 Difference]: Without dead ends: 81426 [2025-03-03 16:24:49,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:49,110 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 1221 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:49,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 3265 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81426 states. [2025-03-03 16:24:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81426 to 80461. [2025-03-03 16:24:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80461 states, 74166 states have (on average 1.66014076531025) internal successors, (123126), 76280 states have internal predecessors, (123126), 3027 states have call successors, (3027), 1101 states have call predecessors, (3027), 3266 states have return successors, (19549), 3208 states have call predecessors, (19549), 3025 states have call successors, (19549) [2025-03-03 16:24:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80461 states to 80461 states and 145702 transitions. [2025-03-03 16:24:52,753 INFO L78 Accepts]: Start accepts. Automaton has 80461 states and 145702 transitions. Word has length 167 [2025-03-03 16:24:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:52,753 INFO L471 AbstractCegarLoop]: Abstraction has 80461 states and 145702 transitions. [2025-03-03 16:24:52,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 80461 states and 145702 transitions. [2025-03-03 16:24:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:24:52,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:52,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:24:52,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:24:52,769 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:52,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1405450944, now seen corresponding path program 1 times [2025-03-03 16:24:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963793336] [2025-03-03 16:24:52,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:52,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:24:52,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:24:52,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:52,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:52,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963793336] [2025-03-03 16:24:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963793336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742652450] [2025-03-03 16:24:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:52,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:52,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:52,845 INFO L87 Difference]: Start difference. First operand 80461 states and 145702 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:25:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:25:00,167 INFO L93 Difference]: Finished difference Result 273628 states and 529315 transitions. [2025-03-03 16:25:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:25:00,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 16:25:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:25:00,998 INFO L225 Difference]: With dead ends: 273628 [2025-03-03 16:25:00,998 INFO L226 Difference]: Without dead ends: 197170 [2025-03-03 16:25:01,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:25:01,271 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 1560 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:25:01,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 3240 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:25:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197170 states. [2025-03-03 16:25:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197170 to 184560. [2025-03-03 16:25:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184560 states, 170819 states have (on average 1.708065262061012) internal successors, (291770), 177179 states have internal predecessors, (291770), 5459 states have call successors, (5459), 1869 states have call predecessors, (5459), 8280 states have return successors, (71133), 5768 states have call predecessors, (71133), 5457 states have call successors, (71133) [2025-03-03 16:25:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184560 states to 184560 states and 368362 transitions. [2025-03-03 16:25:09,643 INFO L78 Accepts]: Start accepts. Automaton has 184560 states and 368362 transitions. Word has length 167 [2025-03-03 16:25:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:25:09,643 INFO L471 AbstractCegarLoop]: Abstraction has 184560 states and 368362 transitions. [2025-03-03 16:25:09,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:25:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 184560 states and 368362 transitions. [2025-03-03 16:25:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:25:09,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:25:09,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:25:09,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:25:09,681 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:25:09,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:25:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1223717695, now seen corresponding path program 1 times [2025-03-03 16:25:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:25:09,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464556691] [2025-03-03 16:25:09,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:25:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:25:09,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:25:09,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:25:09,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:25:09,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:25:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:25:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:25:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464556691] [2025-03-03 16:25:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464556691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:25:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:25:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:25:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472958448] [2025-03-03 16:25:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:25:09,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:25:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:25:09,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:25:09,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:25:09,789 INFO L87 Difference]: Start difference. First operand 184560 states and 368362 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)