./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.07.cil-1.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 b08ac6f553c71235d6c242059db3dcace1924bc9c3a272f401632c3f1b127664 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:35:21,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:35:21,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:35:21,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:35:21,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:35:21,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:35:21,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:35:21,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:35:21,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:35:21,437 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:35:21,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:35:21,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:35:21,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:35:21,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:35:21,437 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:35:21,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:35:21,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:35:21,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:21,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:35:21,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:35:21,439 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 -> b08ac6f553c71235d6c242059db3dcace1924bc9c3a272f401632c3f1b127664 [2025-03-08 07:35:21,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:35:21,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:35:21,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:35:21,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:35:21,703 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:35:21,705 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.07.cil-1.c [2025-03-08 07:35:22,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22b0fbc39/a78bf0293b11413381213cf22e8c4fc4/FLAG5fe07aa39 [2025-03-08 07:35:23,158 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:35:23,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c [2025-03-08 07:35:23,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22b0fbc39/a78bf0293b11413381213cf22e8c4fc4/FLAG5fe07aa39 [2025-03-08 07:35:23,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22b0fbc39/a78bf0293b11413381213cf22e8c4fc4 [2025-03-08 07:35:23,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:35:23,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:35:23,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:23,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:35:23,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:35:23,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4687e745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23, skipping insertion in model container [2025-03-08 07:35:23,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:35:23,360 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.07.cil-1.c[911,924] [2025-03-08 07:35:23,437 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.07.cil-1.c[8416,8429] [2025-03-08 07:35:23,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:23,518 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:35:23,525 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.07.cil-1.c[911,924] [2025-03-08 07:35:23,550 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.07.cil-1.c[8416,8429] [2025-03-08 07:35:23,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:23,606 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:35:23,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23 WrapperNode [2025-03-08 07:35:23,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:23,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:23,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:35:23,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:35:23,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,668 INFO L138 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 764 [2025-03-08 07:35:23,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:23,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:35:23,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:35:23,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:35:23,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,707 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-08 07:35:23,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:35:23,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:35:23,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:35:23,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:35:23,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (1/1) ... [2025-03-08 07:35:23,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:35:23,766 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-08 07:35:23,770 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-08 07:35:23,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:35:23,790 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:35:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:35:23,790 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:35:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:35:23,790 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:35:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:35:23,790 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:35:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:35:23,790 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:35:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:35:23,790 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:35:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:35:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:35:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:35:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:35:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:35:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:35:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:35:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:35:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:35:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:35:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:35:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:35:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:35:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:35:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:35:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:35:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:35:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:35:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:35:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:35:23,880 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:35:23,882 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:35:24,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-08 07:35:24,425 INFO L1307 $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-08 07:35:24,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-08 07:35:24,524 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-08 07:35:24,525 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:35:24,544 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:35:24,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:35:24,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:24 BoogieIcfgContainer [2025-03-08 07:35:24,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:35:24,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:35:24,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:35:24,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:35:24,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:35:23" (1/3) ... [2025-03-08 07:35:24,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388a02b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:24, skipping insertion in model container [2025-03-08 07:35:24,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:23" (2/3) ... [2025-03-08 07:35:24,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388a02b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:24, skipping insertion in model container [2025-03-08 07:35:24,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:24" (3/3) ... [2025-03-08 07:35:24,556 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.07.cil-1.c [2025-03-08 07:35:24,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:35:24,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.07.cil-1.c that has 15 procedures, 368 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-03-08 07:35:24,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:35:24,627 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;@6cc4ea4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:35:24,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:35:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 316 states have (on average 1.5696202531645569) internal successors, (496), 320 states have internal predecessors, (496), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 07:35:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:24,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:24,641 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] [2025-03-08 07:35:24,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:24,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1675780186, now seen corresponding path program 1 times [2025-03-08 07:35:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107781269] [2025-03-08 07:35:24,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:24,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:24,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:24,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:24,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:25,032 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-08 07:35:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107781269] [2025-03-08 07:35:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107781269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:25,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317294909] [2025-03-08 07:35:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:25,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:25,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:25,060 INFO L87 Difference]: Start difference. First operand has 368 states, 316 states have (on average 1.5696202531645569) internal successors, (496), 320 states have internal predecessors, (496), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 07:35:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:25,775 INFO L93 Difference]: Finished difference Result 828 states and 1281 transitions. [2025-03-08 07:35:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:25,786 INFO L225 Difference]: With dead ends: 828 [2025-03-08 07:35:25,786 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 07:35:25,790 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-08 07:35:25,792 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 416 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:25,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1177 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 07:35:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 466. [2025-03-08 07:35:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 392 states have (on average 1.5127551020408163) internal successors, (593), 398 states have internal predecessors, (593), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2025-03-08 07:35:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 696 transitions. [2025-03-08 07:35:25,860 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 696 transitions. Word has length 63 [2025-03-08 07:35:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:25,861 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 696 transitions. [2025-03-08 07:35:25,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 07:35:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 696 transitions. [2025-03-08 07:35:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:25,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:25,864 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] [2025-03-08 07:35:25,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:35:25,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1614962758, now seen corresponding path program 1 times [2025-03-08 07:35:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826086733] [2025-03-08 07:35:25,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:25,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:25,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:25,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:25,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:26,088 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-08 07:35:26,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:26,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826086733] [2025-03-08 07:35:26,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826086733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:26,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:26,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:26,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705799384] [2025-03-08 07:35:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:26,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:26,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:26,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:26,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:26,093 INFO L87 Difference]: Start difference. First operand 466 states and 696 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-08 07:35:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:26,783 INFO L93 Difference]: Finished difference Result 821 states and 1199 transitions. [2025-03-08 07:35:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:26,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:26,792 INFO L225 Difference]: With dead ends: 821 [2025-03-08 07:35:26,792 INFO L226 Difference]: Without dead ends: 620 [2025-03-08 07:35:26,793 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-08 07:35:26,793 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 786 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:26,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1434 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-08 07:35:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 574. [2025-03-08 07:35:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 478 states have (on average 1.49581589958159) internal successors, (715), 486 states have internal predecessors, (715), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2025-03-08 07:35:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 852 transitions. [2025-03-08 07:35:26,840 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 852 transitions. Word has length 63 [2025-03-08 07:35:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:26,840 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 852 transitions. [2025-03-08 07:35:26,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-08 07:35:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 852 transitions. [2025-03-08 07:35:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:26,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:26,845 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] [2025-03-08 07:35:26,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:35:26,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:26,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1622722117, now seen corresponding path program 1 times [2025-03-08 07:35:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:26,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402253162] [2025-03-08 07:35:26,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:26,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:26,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:26,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:26,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:26,932 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-08 07:35:26,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402253162] [2025-03-08 07:35:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402253162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:26,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:26,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:35:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607925432] [2025-03-08 07:35:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:26,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:35:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:26,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:35:26,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:35:26,935 INFO L87 Difference]: Start difference. First operand 574 states and 852 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:27,120 INFO L93 Difference]: Finished difference Result 1444 states and 2098 transitions. [2025-03-08 07:35:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:35:27,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-03-08 07:35:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:27,130 INFO L225 Difference]: With dead ends: 1444 [2025-03-08 07:35:27,130 INFO L226 Difference]: Without dead ends: 1141 [2025-03-08 07:35:27,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:35:27,133 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 635 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:27,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1241 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:35:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-08 07:35:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1124. [2025-03-08 07:35:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 918 states have (on average 1.4411764705882353) internal successors, (1323), 934 states have internal predecessors, (1323), 123 states have call successors, (123), 70 states have call predecessors, (123), 81 states have return successors, (159), 123 states have call predecessors, (159), 121 states have call successors, (159) [2025-03-08 07:35:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1605 transitions. [2025-03-08 07:35:27,205 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1605 transitions. Word has length 63 [2025-03-08 07:35:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:27,205 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1605 transitions. [2025-03-08 07:35:27,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1605 transitions. [2025-03-08 07:35:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:27,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:27,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:27,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:35:27,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:27,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash 4204023, now seen corresponding path program 1 times [2025-03-08 07:35:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889103353] [2025-03-08 07:35:27,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:27,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:27,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:27,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:27,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:27,290 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-08 07:35:27,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:27,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889103353] [2025-03-08 07:35:27,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889103353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:27,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638321045] [2025-03-08 07:35:27,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:27,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:27,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:27,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:27,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:27,292 INFO L87 Difference]: Start difference. First operand 1124 states and 1605 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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-08 07:35:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:27,373 INFO L93 Difference]: Finished difference Result 1997 states and 2839 transitions. [2025-03-08 07:35:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:27,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2025-03-08 07:35:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:27,381 INFO L225 Difference]: With dead ends: 1997 [2025-03-08 07:35:27,381 INFO L226 Difference]: Without dead ends: 1144 [2025-03-08 07:35:27,383 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-08 07:35:27,385 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 0 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2689 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-08 07:35:27,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2689 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-08 07:35:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2025-03-08 07:35:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 934 states have (on average 1.4282655246252676) internal successors, (1334), 950 states have internal predecessors, (1334), 123 states have call successors, (123), 70 states have call predecessors, (123), 85 states have return successors, (166), 127 states have call predecessors, (166), 121 states have call successors, (166) [2025-03-08 07:35:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1623 transitions. [2025-03-08 07:35:27,459 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1623 transitions. Word has length 64 [2025-03-08 07:35:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:27,459 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1623 transitions. [2025-03-08 07:35:27,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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-08 07:35:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1623 transitions. [2025-03-08 07:35:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:27,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:27,461 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] [2025-03-08 07:35:27,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:35:27,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:27,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1954504278, now seen corresponding path program 1 times [2025-03-08 07:35:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:27,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599319313] [2025-03-08 07:35:27,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:27,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:27,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:27,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:27,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:27,552 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-08 07:35:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:27,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599319313] [2025-03-08 07:35:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599319313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:27,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963474248] [2025-03-08 07:35:27,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:27,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:27,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:27,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:27,554 INFO L87 Difference]: Start difference. First operand 1144 states and 1623 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:28,084 INFO L93 Difference]: Finished difference Result 3606 states and 5060 transitions. [2025-03-08 07:35:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:35:28,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-03-08 07:35:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:28,092 INFO L225 Difference]: With dead ends: 3606 [2025-03-08 07:35:28,092 INFO L226 Difference]: Without dead ends: 1434 [2025-03-08 07:35:28,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:28,098 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 1537 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:28,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 2322 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2025-03-08 07:35:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1069. [2025-03-08 07:35:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 859 states have (on average 1.3969732246798603) internal successors, (1200), 875 states have internal predecessors, (1200), 123 states have call successors, (123), 70 states have call predecessors, (123), 85 states have return successors, (154), 127 states have call predecessors, (154), 121 states have call successors, (154) [2025-03-08 07:35:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1477 transitions. [2025-03-08 07:35:28,161 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1477 transitions. Word has length 64 [2025-03-08 07:35:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:28,161 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1477 transitions. [2025-03-08 07:35:28,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1477 transitions. [2025-03-08 07:35:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:35:28,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:28,163 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-08 07:35:28,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:35:28,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:28,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1850006633, now seen corresponding path program 1 times [2025-03-08 07:35:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915560923] [2025-03-08 07:35:28,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:28,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:35:28,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:35:28,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:28,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:28,293 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-08 07:35:28,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:28,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915560923] [2025-03-08 07:35:28,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915560923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:28,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:28,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:35:28,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774859028] [2025-03-08 07:35:28,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:28,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:35:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:28,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:35:28,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:35:28,295 INFO L87 Difference]: Start difference. First operand 1069 states and 1477 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:28,981 INFO L93 Difference]: Finished difference Result 2148 states and 2923 transitions. [2025-03-08 07:35:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:35:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-03-08 07:35:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:28,984 INFO L225 Difference]: With dead ends: 2148 [2025-03-08 07:35:28,985 INFO L226 Difference]: Without dead ends: 251 [2025-03-08 07:35:28,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:35:28,989 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 922 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:28,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 1376 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-08 07:35:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-08 07:35:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 223 states have (on average 1.5560538116591929) internal successors, (347), 224 states have internal predecessors, (347), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 07:35:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 389 transitions. [2025-03-08 07:35:29,000 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 389 transitions. Word has length 65 [2025-03-08 07:35:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:29,000 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 389 transitions. [2025-03-08 07:35:29,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 389 transitions. [2025-03-08 07:35:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:29,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:29,004 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] [2025-03-08 07:35:29,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:35:29,004 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:29,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:29,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1791750443, now seen corresponding path program 1 times [2025-03-08 07:35:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:29,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754508302] [2025-03-08 07:35:29,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:29,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:29,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:29,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:29,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:29,130 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-08 07:35:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754508302] [2025-03-08 07:35:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754508302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:29,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466281698] [2025-03-08 07:35:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:29,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:29,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:29,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:29,133 INFO L87 Difference]: Start difference. First operand 251 states and 389 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-08 07:35:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:29,466 INFO L93 Difference]: Finished difference Result 749 states and 1173 transitions. [2025-03-08 07:35:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:29,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:29,469 INFO L225 Difference]: With dead ends: 749 [2025-03-08 07:35:29,469 INFO L226 Difference]: Without dead ends: 514 [2025-03-08 07:35:29,470 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-08 07:35:29,471 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 725 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:29,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1150 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-08 07:35:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 495. [2025-03-08 07:35:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 444 states have (on average 1.5675675675675675) internal successors, (696), 446 states have internal predecessors, (696), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2025-03-08 07:35:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 771 transitions. [2025-03-08 07:35:29,489 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 771 transitions. Word has length 121 [2025-03-08 07:35:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:29,490 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 771 transitions. [2025-03-08 07:35:29,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-08 07:35:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 771 transitions. [2025-03-08 07:35:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:29,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:29,491 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] [2025-03-08 07:35:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:35:29,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1450326551, now seen corresponding path program 1 times [2025-03-08 07:35:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:29,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930461410] [2025-03-08 07:35:29,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:29,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:29,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:29,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:29,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:29,603 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-08 07:35:29,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:29,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930461410] [2025-03-08 07:35:29,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930461410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:29,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:29,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647350226] [2025-03-08 07:35:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:29,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:29,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:29,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:29,605 INFO L87 Difference]: Start difference. First operand 495 states and 771 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:30,052 INFO L93 Difference]: Finished difference Result 1284 states and 2022 transitions. [2025-03-08 07:35:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:30,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:30,056 INFO L225 Difference]: With dead ends: 1284 [2025-03-08 07:35:30,057 INFO L226 Difference]: Without dead ends: 805 [2025-03-08 07:35:30,058 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-08 07:35:30,058 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 725 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:30,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2013 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-08 07:35:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 722. [2025-03-08 07:35:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 648 states have (on average 1.5601851851851851) internal successors, (1011), 651 states have internal predecessors, (1011), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (57), 54 states have call predecessors, (57), 53 states have call successors, (57) [2025-03-08 07:35:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1121 transitions. [2025-03-08 07:35:30,084 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1121 transitions. Word has length 121 [2025-03-08 07:35:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:30,085 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1121 transitions. [2025-03-08 07:35:30,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1121 transitions. [2025-03-08 07:35:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:30,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:30,086 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] [2025-03-08 07:35:30,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:35:30,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:30,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash 516972214, now seen corresponding path program 1 times [2025-03-08 07:35:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:30,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349295973] [2025-03-08 07:35:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:30,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:30,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:30,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:30,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:30,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:30,202 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-08 07:35:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:30,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349295973] [2025-03-08 07:35:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349295973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:30,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:30,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324711800] [2025-03-08 07:35:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:30,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:30,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:30,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:30,203 INFO L87 Difference]: Start difference. First operand 722 states and 1121 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:30,696 INFO L93 Difference]: Finished difference Result 2005 states and 3151 transitions. [2025-03-08 07:35:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:30,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:30,702 INFO L225 Difference]: With dead ends: 2005 [2025-03-08 07:35:30,703 INFO L226 Difference]: Without dead ends: 1299 [2025-03-08 07:35:30,704 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-08 07:35:30,705 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 720 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:30,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1997 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-08 07:35:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1205. [2025-03-08 07:35:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1083 states have (on average 1.5623268698060941) internal successors, (1692), 1090 states have internal predecessors, (1692), 85 states have call successors, (85), 30 states have call predecessors, (85), 36 states have return successors, (101), 88 states have call predecessors, (101), 85 states have call successors, (101) [2025-03-08 07:35:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1878 transitions. [2025-03-08 07:35:30,749 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1878 transitions. Word has length 121 [2025-03-08 07:35:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:30,749 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1878 transitions. [2025-03-08 07:35:30,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1878 transitions. [2025-03-08 07:35:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:30,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:35:30,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:35:30,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2010884663, now seen corresponding path program 1 times [2025-03-08 07:35:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634464030] [2025-03-08 07:35:30,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:30,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:30,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:30,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:30,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:30,850 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-08 07:35:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634464030] [2025-03-08 07:35:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634464030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:30,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327512864] [2025-03-08 07:35:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:30,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:30,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:30,851 INFO L87 Difference]: Start difference. First operand 1205 states and 1878 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:31,426 INFO L93 Difference]: Finished difference Result 3558 states and 5634 transitions. [2025-03-08 07:35:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:31,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:31,437 INFO L225 Difference]: With dead ends: 3558 [2025-03-08 07:35:31,437 INFO L226 Difference]: Without dead ends: 2369 [2025-03-08 07:35:31,440 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-08 07:35:31,441 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 715 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:31,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1985 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-08 07:35:31,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2252. [2025-03-08 07:35:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2028 states have (on average 1.5759368836291914) internal successors, (3196), 2049 states have internal predecessors, (3196), 149 states have call successors, (149), 54 states have call predecessors, (149), 74 states have return successors, (213), 156 states have call predecessors, (213), 149 states have call successors, (213) [2025-03-08 07:35:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3558 transitions. [2025-03-08 07:35:31,535 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3558 transitions. Word has length 121 [2025-03-08 07:35:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:31,536 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3558 transitions. [2025-03-08 07:35:31,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3558 transitions. [2025-03-08 07:35:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:31,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:31,538 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] [2025-03-08 07:35:31,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:35:31,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:31,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash 812149398, now seen corresponding path program 1 times [2025-03-08 07:35:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:31,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023233571] [2025-03-08 07:35:31,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:31,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:31,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:31,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:31,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:31,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:31,637 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-08 07:35:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023233571] [2025-03-08 07:35:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023233571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592899496] [2025-03-08 07:35:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:31,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:31,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:31,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:31,639 INFO L87 Difference]: Start difference. First operand 2252 states and 3558 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:32,172 INFO L93 Difference]: Finished difference Result 6969 states and 11252 transitions. [2025-03-08 07:35:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:32,192 INFO L225 Difference]: With dead ends: 6969 [2025-03-08 07:35:32,192 INFO L226 Difference]: Without dead ends: 4733 [2025-03-08 07:35:32,198 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-08 07:35:32,199 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 710 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1973 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4733 states. [2025-03-08 07:35:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4733 to 4571. [2025-03-08 07:35:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4571 states, 4125 states have (on average 1.599030303030303) internal successors, (6596), 4192 states have internal predecessors, (6596), 277 states have call successors, (277), 102 states have call predecessors, (277), 168 states have return successors, (533), 292 states have call predecessors, (533), 277 states have call successors, (533) [2025-03-08 07:35:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 7406 transitions. [2025-03-08 07:35:32,413 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 7406 transitions. Word has length 121 [2025-03-08 07:35:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:32,414 INFO L471 AbstractCegarLoop]: Abstraction has 4571 states and 7406 transitions. [2025-03-08 07:35:32,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 7406 transitions. [2025-03-08 07:35:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:32,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:35:32,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:35:32,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1327669847, now seen corresponding path program 1 times [2025-03-08 07:35:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536936762] [2025-03-08 07:35:32,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:32,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:32,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:32,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:32,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:32,519 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-08 07:35:32,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:32,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536936762] [2025-03-08 07:35:32,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536936762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:32,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:32,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113494319] [2025-03-08 07:35:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:32,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:32,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:32,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:32,520 INFO L87 Difference]: Start difference. First operand 4571 states and 7406 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:33,197 INFO L93 Difference]: Finished difference Result 14632 states and 24422 transitions. [2025-03-08 07:35:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:33,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:33,243 INFO L225 Difference]: With dead ends: 14632 [2025-03-08 07:35:33,243 INFO L226 Difference]: Without dead ends: 10077 [2025-03-08 07:35:33,259 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-08 07:35:33,261 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 705 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:33,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1961 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10077 states. [2025-03-08 07:35:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10077 to 9830. [2025-03-08 07:35:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9830 states, 8886 states have (on average 1.6281791582264236) internal successors, (14468), 9099 states have internal predecessors, (14468), 533 states have call successors, (533), 198 states have call predecessors, (533), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-03-08 07:35:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9830 states to 9830 states and 16558 transitions. [2025-03-08 07:35:33,777 INFO L78 Accepts]: Start accepts. Automaton has 9830 states and 16558 transitions. Word has length 121 [2025-03-08 07:35:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:33,778 INFO L471 AbstractCegarLoop]: Abstraction has 9830 states and 16558 transitions. [2025-03-08 07:35:33,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 9830 states and 16558 transitions. [2025-03-08 07:35:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:33,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:33,790 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] [2025-03-08 07:35:33,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:35:33,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:33,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 374468214, now seen corresponding path program 1 times [2025-03-08 07:35:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:33,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484792994] [2025-03-08 07:35:33,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:33,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:33,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:33,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:33,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:33,896 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-08 07:35:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484792994] [2025-03-08 07:35:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484792994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:33,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565518070] [2025-03-08 07:35:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:33,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:33,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:33,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:33,898 INFO L87 Difference]: Start difference. First operand 9830 states and 16558 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:34,889 INFO L93 Difference]: Finished difference Result 32267 states and 56628 transitions. [2025-03-08 07:35:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:34,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:34,985 INFO L225 Difference]: With dead ends: 32267 [2025-03-08 07:35:34,985 INFO L226 Difference]: Without dead ends: 22453 [2025-03-08 07:35:35,020 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-08 07:35:35,021 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 700 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:35,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1949 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22453 states. [2025-03-08 07:35:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22453 to 22049. [2025-03-08 07:35:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22049 states, 19947 states have (on average 1.6599989973429587) internal successors, (33112), 20614 states have internal predecessors, (33112), 1045 states have call successors, (1045), 390 states have call predecessors, (1045), 1056 states have return successors, (5141), 1108 states have call predecessors, (5141), 1045 states have call successors, (5141) [2025-03-08 07:35:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22049 states to 22049 states and 39298 transitions. [2025-03-08 07:35:36,142 INFO L78 Accepts]: Start accepts. Automaton has 22049 states and 39298 transitions. Word has length 121 [2025-03-08 07:35:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:36,143 INFO L471 AbstractCegarLoop]: Abstraction has 22049 states and 39298 transitions. [2025-03-08 07:35:36,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 22049 states and 39298 transitions. [2025-03-08 07:35:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:36,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:36,154 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] [2025-03-08 07:35:36,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:35:36,154 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:36,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:36,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1175003767, now seen corresponding path program 1 times [2025-03-08 07:35:36,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:36,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217836637] [2025-03-08 07:35:36,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:36,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:36,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:36,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:36,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:36,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:36,325 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-08 07:35:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217836637] [2025-03-08 07:35:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217836637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054190433] [2025-03-08 07:35:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:36,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:36,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:36,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:36,327 INFO L87 Difference]: Start difference. First operand 22049 states and 39298 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:38,422 INFO L93 Difference]: Finished difference Result 73826 states and 139306 transitions. [2025-03-08 07:35:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:38,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:38,718 INFO L225 Difference]: With dead ends: 73826 [2025-03-08 07:35:38,718 INFO L226 Difference]: Without dead ends: 51793 [2025-03-08 07:35:38,808 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-08 07:35:38,809 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 695 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:38,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1937 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51793 states. [2025-03-08 07:35:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51793 to 51104. [2025-03-08 07:35:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51104 states, 46200 states have (on average 1.6914285714285715) internal successors, (78144), 48261 states have internal predecessors, (78144), 2069 states have call successors, (2069), 774 states have call predecessors, (2069), 2834 states have return successors, (18453), 2196 states have call predecessors, (18453), 2069 states have call successors, (18453) [2025-03-08 07:35:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51104 states to 51104 states and 98666 transitions. [2025-03-08 07:35:41,362 INFO L78 Accepts]: Start accepts. Automaton has 51104 states and 98666 transitions. Word has length 121 [2025-03-08 07:35:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:41,362 INFO L471 AbstractCegarLoop]: Abstraction has 51104 states and 98666 transitions. [2025-03-08 07:35:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 51104 states and 98666 transitions. [2025-03-08 07:35:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:41,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:41,385 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] [2025-03-08 07:35:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:35:41,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:41,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash 646638166, now seen corresponding path program 1 times [2025-03-08 07:35:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666436594] [2025-03-08 07:35:41,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:41,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:41,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:41,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:41,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:41,490 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-08 07:35:41,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:41,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666436594] [2025-03-08 07:35:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666436594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:41,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:41,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213432441] [2025-03-08 07:35:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:41,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:41,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:41,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:41,492 INFO L87 Difference]: Start difference. First operand 51104 states and 98666 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:46,140 INFO L93 Difference]: Finished difference Result 180805 states and 373849 transitions. [2025-03-08 07:35:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 07:35:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:46,815 INFO L225 Difference]: With dead ends: 180805 [2025-03-08 07:35:46,815 INFO L226 Difference]: Without dead ends: 129717 [2025-03-08 07:35:47,137 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-08 07:35:47,137 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 914 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:47,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1912 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129717 states. [2025-03-08 07:35:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129717 to 121223. [2025-03-08 07:35:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121223 states, 109385 states have (on average 1.7214426109612835) internal successors, (188300), 115692 states have internal predecessors, (188300), 3989 states have call successors, (3989), 1542 states have call predecessors, (3989), 7848 states have return successors, (69525), 4244 states have call predecessors, (69525), 3989 states have call successors, (69525) [2025-03-08 07:35:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121223 states to 121223 states and 261814 transitions. [2025-03-08 07:35:54,071 INFO L78 Accepts]: Start accepts. Automaton has 121223 states and 261814 transitions. Word has length 121 [2025-03-08 07:35:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:54,071 INFO L471 AbstractCegarLoop]: Abstraction has 121223 states and 261814 transitions. [2025-03-08 07:35:54,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-08 07:35:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 121223 states and 261814 transitions. [2025-03-08 07:35:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 07:35:54,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:54,107 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] [2025-03-08 07:35:54,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:35:54,107 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:54,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1322330775, now seen corresponding path program 1 times [2025-03-08 07:35:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712906173] [2025-03-08 07:35:54,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:54,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 07:35:54,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 07:35:54,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:54,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:54,196 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-08 07:35:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712906173] [2025-03-08 07:35:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712906173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771702072] [2025-03-08 07:35:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:54,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:54,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:54,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:54,199 INFO L87 Difference]: Start difference. First operand 121223 states and 261814 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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)