./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f1e5a0d04cda68be8a659e3f7c3c8d0a5df6c0732a10757201346fc85875f569 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:38:10,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:38:10,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:38:10,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:38:10,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:38:10,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:38:10,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:38:10,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:38:10,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:38:10,179 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:38:10,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:38:10,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:38:10,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:38:10,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:38:10,179 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:38:10,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:38:10,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:38:10,180 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:38:10,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:38:10,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:38:10,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:38:10,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:38:10,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:38:10,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:38:10,182 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-jdk21/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 -> f1e5a0d04cda68be8a659e3f7c3c8d0a5df6c0732a10757201346fc85875f569 [2025-02-07 21:38:10,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:38:10,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:38:10,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:38:10,400 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:38:10,401 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:38:10,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c [2025-02-07 21:38:11,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cda59a56d/44fc5e6312ff49c5b2cf787b086d5745/FLAG8a3b6ae46 [2025-02-07 21:38:12,484 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:38:12,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c [2025-02-07 21:38:12,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cda59a56d/44fc5e6312ff49c5b2cf787b086d5745/FLAG8a3b6ae46 [2025-02-07 21:38:12,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cda59a56d/44fc5e6312ff49c5b2cf787b086d5745 [2025-02-07 21:38:12,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:38:12,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:38:12,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:38:12,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:38:12,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:38:12,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:38:12" (1/1) ... [2025-02-07 21:38:12,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e7fd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:12, skipping insertion in model container [2025-02-07 21:38:12,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:38:12" (1/1) ... [2025-02-07 21:38:12,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:38:14,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c[376251,376264] [2025-02-07 21:38:14,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c[383339,383352] [2025-02-07 21:38:14,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:38:14,232 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:38:15,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c[376251,376264] [2025-02-07 21:38:15,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c[383339,383352] [2025-02-07 21:38:15,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:38:15,163 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:38:15,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15 WrapperNode [2025-02-07 21:38:15,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:38:15,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:38:15,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:38:15,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:38:15,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,568 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-02-07 21:38:15,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:38:15,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:38:15,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:38:15,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:38:15,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,789 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-02-07 21:38:15,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:15,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:16,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:38:16,003 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:38:16,003 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:38:16,003 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:38:16,004 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (1/1) ... [2025-02-07 21:38:16,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:38:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:38:16,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:38:16,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:38:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:38:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-07 21:38:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-07 21:38:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-07 21:38:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-07 21:38:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-07 21:38:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-07 21:38:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-07 21:38:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-07 21:38:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-07 21:38:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-07 21:38:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-07 21:38:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-07 21:38:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:38:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:38:16,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:38:16,146 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:38:16,147 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:38:22,550 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11861-1: assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret37#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1; [2025-02-07 21:38:22,550 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11861: start_simulation_#t~ret39#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret37#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;assume -2147483648 <= start_simulation_#t~ret39#1 && start_simulation_#t~ret39#1 <= 2147483647;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret39#1;havoc start_simulation_#t~ret39#1; [2025-02-07 21:38:22,550 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11863: assume 0 != start_simulation_~tmp___0~1#1; [2025-02-07 21:38:22,550 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11863: assume !(0 != start_simulation_~tmp___0~1#1); [2025-02-07 21:38:22,550 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11336: assume true;~t3_pc~0 := 1;~t3_st~0 := 2; [2025-02-07 21:38:22,550 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11336: assume !true; [2025-02-07 21:38:22,550 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11344: ~token~0 := 1 + ~token~0;~E_M~0 := 1; [2025-02-07 21:38:22,551 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11346: ~E_M~0 := 2; [2025-02-07 21:38:22,551 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11346-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:38:22,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11880: assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret38#1, start_simulation_#t~ret39#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; [2025-02-07 21:38:22,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1;calculate_output2_#t~ret15#1 := calculate_output3_#res#1;havoc calculate_output3_#t~ret16#1, calculate_output3_~input#1;havoc calculate_output3_#in~input#1;assume { :end_inline_calculate_output3 } true;assume -2147483648 <= calculate_output2_#t~ret15#1 && calculate_output2_#t~ret15#1 <= 2147483647;calculate_output2_#res#1 := calculate_output2_#t~ret15#1;havoc calculate_output2_#t~ret15#1; [2025-02-07 21:38:22,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11881: havoc start_simulation_#t~ret38#1, start_simulation_#t~ret39#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;assume { :end_inline_start_simulation } true;main2_~__retres1~5#1 := 0;main2_#res#1 := main2_~__retres1~5#1; [2025-02-07 21:38:22,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11892: main_#t~ret42#1 := main2_#res#1;havoc main2_~__retres1~5#1;assume { :end_inline_main2 } true;assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647; [2025-02-07 21:38:22,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1;calculate_output4_#t~ret17#1 := calculate_output5_#res#1;havoc calculate_output5_#t~ret18#1, calculate_output5_~input#1;havoc calculate_output5_#in~input#1;assume { :end_inline_calculate_output5 } true;assume -2147483648 <= calculate_output4_#t~ret17#1 && calculate_output4_#t~ret17#1 <= 2147483647;calculate_output4_#res#1 := calculate_output4_#t~ret17#1;havoc calculate_output4_#t~ret17#1; [2025-02-07 21:38:22,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11173: assume false;assume false; [2025-02-07 21:38:22,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11173: assume !false; [2025-02-07 21:38:22,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11445: assume 1 == ~m_i~0;~m_st~0 := 0; [2025-02-07 21:38:22,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11445: assume !(1 == ~m_i~0);~m_st~0 := 2; [2025-02-07 21:38:22,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11450: assume 1 == ~t1_i~0;~t1_st~0 := 0; [2025-02-07 21:38:22,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11450: assume !(1 == ~t1_i~0);~t1_st~0 := 2; [2025-02-07 21:38:22,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11455: assume 1 == ~t2_i~0;~t2_st~0 := 0; [2025-02-07 21:38:22,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11455: assume !(1 == ~t2_i~0);~t2_st~0 := 2; [2025-02-07 21:38:22,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11460: assume 1 == ~t3_i~0;~t3_st~0 := 0; [2025-02-07 21:38:22,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11460: assume !(1 == ~t3_i~0);~t3_st~0 := 2; [2025-02-07 21:38:22,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11209: assume 0 == ~m_pc~0; [2025-02-07 21:38:22,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11209: assume !(0 == ~m_pc~0); [2025-02-07 21:38:22,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11212: assume 1 == ~m_pc~0; [2025-02-07 21:38:22,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11212: assume !(1 == ~m_pc~0); [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11741: assume 1 == ~M_E~0;~M_E~0 := 2; [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11741: assume !(1 == ~M_E~0); [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11746: assume 1 == ~T1_E~0;~T1_E~0 := 2; [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11746: assume !(1 == ~T1_E~0); [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11220: assume true;havoc master_#t~nondet27#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;~token~0 := master_#t~nondet27#1;havoc master_#t~nondet27#1;~local~0 := ~token~0;~E_1~0 := 1; [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11220: assume !true; [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11751: assume 1 == ~T2_E~0;~T2_E~0 := 2; [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11751: assume !(1 == ~T2_E~0); [2025-02-07 21:38:22,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1;calculate_output_#t~ret14#1 := calculate_output2_#res#1;havoc calculate_output2_#t~ret15#1, calculate_output2_~input#1;havoc calculate_output2_#in~input#1;assume { :end_inline_calculate_output2 } true;assume -2147483648 <= calculate_output_#t~ret14#1 && calculate_output_#t~ret14#1 <= 2147483647;calculate_output_#res#1 := calculate_output_#t~ret14#1;havoc calculate_output_#t~ret14#1; [2025-02-07 21:38:22,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11226: ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; [2025-02-07 21:38:22,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11226-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:38:22,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11756: assume 1 == ~T3_E~0;~T3_E~0 := 2; [2025-02-07 21:38:22,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11756: assume !(1 == ~T3_E~0); [2025-02-07 21:38:22,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11761: assume 1 == ~E_M~0;~E_M~0 := 2; [2025-02-07 21:38:22,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11761: assume !(1 == ~E_M~0); [2025-02-07 21:38:22,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1;calculate_output6_#t~ret19#1 := calculate_output7_#res#1;havoc calculate_output7_#t~ret20#1, calculate_output7_~input#1;havoc calculate_output7_#in~input#1;assume { :end_inline_calculate_output7 } true;assume -2147483648 <= calculate_output6_#t~ret19#1 && calculate_output6_#t~ret19#1 <= 2147483647;calculate_output6_#res#1 := calculate_output6_#t~ret19#1;havoc calculate_output6_#t~ret19#1; [2025-02-07 21:38:22,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440-2: calculate_output7_#t~ret20#1 := calculate_output8_#res#1;havoc calculate_output8_~input#1;havoc calculate_output8_#in~input#1;assume { :end_inline_calculate_output8 } true;assume -2147483648 <= calculate_output7_#t~ret20#1 && calculate_output7_#t~ret20#1 <= 2147483647;calculate_output7_#res#1 := calculate_output7_#t~ret20#1;havoc calculate_output7_#t~ret20#1; [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11234: assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error } true; [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11234: assume !(~token~0 != 3 + ~local~0); [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11236: assume { :end_inline_error } true; [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11766: assume 1 == ~E_1~0;~E_1~0 := 2; [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11766: assume !(1 == ~E_1~0); [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11505: assume true; [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11505: assume !true; [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11771: assume 1 == ~E_2~0;~E_2~0 := 2; [2025-02-07 21:38:22,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11771: assume !(1 == ~E_2~0); [2025-02-07 21:38:22,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11508: assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; [2025-02-07 21:38:22,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11508-1: SUMMARY for call eval_#t~ret28#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:38:22,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11510: assume 0 != eval_~tmp~0#1; [2025-02-07 21:38:22,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11510: assume !(0 != eval_~tmp~0#1); [2025-02-07 21:38:22,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11776: assume 1 == ~E_3~0;~E_3~0 := 2; [2025-02-07 21:38:22,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11776: assume !(1 == ~E_3~0); [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11515-1: assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;havoc eval_#t~nondet29#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11515-1: assume !(0 == ~m_st~0); [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11515: havoc eval_~tmp_ndt_1~0#1; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11253: assume 0 == ~t1_pc~0; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11253: assume !(0 == ~t1_pc~0); [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11518: assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11518: assume !(0 != eval_~tmp_ndt_1~0#1); [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11256: assume 1 == ~t1_pc~0; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11256: assume !(1 == ~t1_pc~0); [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11521: havoc master_#t~nondet27#1;assume { :end_inline_master } true; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11264: assume true;~t1_pc~0 := 1;~t1_st~0 := 2; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11264: assume !true; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11529-1: assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;havoc eval_#t~nondet30#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_2~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11529-1: assume !(0 == ~t1_st~0); [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11529: havoc eval_~tmp_ndt_2~0#1; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11532: assume 0 != eval_~tmp_ndt_2~0#1;~t1_st~0 := 1;assume { :begin_inline_transmit1 } true; [2025-02-07 21:38:22,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11532: assume !(0 != eval_~tmp_ndt_2~0#1); [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11535: assume { :end_inline_transmit1 } true; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11272: ~token~0 := 1 + ~token~0;~E_2~0 := 1; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11274: ~E_2~0 := 2; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11274-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11803-1: SUMMARY for call stop_simulation_#t~ret37#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11803: assume -2147483648 <= stop_simulation_#t~ret37#1 && stop_simulation_#t~ret37#1 <= 2147483647;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret37#1;havoc stop_simulation_#t~ret37#1; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11805: assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11805: assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11543-1: assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;havoc eval_#t~nondet31#1;assume -2147483648 <= eval_#t~nondet31#1 && eval_#t~nondet31#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet31#1;havoc eval_#t~nondet31#1; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11543-1: assume !(0 == ~t2_st~0); [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11543: havoc eval_~tmp_ndt_3~0#1; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11546: assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11546: assume !(0 != eval_~tmp_ndt_3~0#1); [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11549: assume { :end_inline_transmit2 } true; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11289: assume 0 == ~t2_pc~0; [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11289: assume !(0 == ~t2_pc~0); [2025-02-07 21:38:22,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11292: assume 1 == ~t2_pc~0; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11292: assume !(1 == ~t2_pc~0); [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11557-1: assume 0 == ~t3_st~0;havoc eval_~tmp_ndt_4~0#1;havoc eval_#t~nondet32#1;assume -2147483648 <= eval_#t~nondet32#1 && eval_#t~nondet32#1 <= 2147483647;eval_~tmp_ndt_4~0#1 := eval_#t~nondet32#1;havoc eval_#t~nondet32#1; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11557-1: assume !(0 == ~t3_st~0); [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11557: havoc eval_~tmp_ndt_4~0#1; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11824: assume { :begin_inline_init_threads } true; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11824-1: SUMMARY for call update_channels(); srcloc: null [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11560: assume 0 != eval_~tmp_ndt_4~0#1;~t3_st~0 := 1;assume { :begin_inline_transmit3 } true; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11560: assume !(0 != eval_~tmp_ndt_4~0#1); [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11825: assume { :end_inline_init_threads } true; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11826: SUMMARY for call fire_delta_events(); srcloc: null [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11827: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11563: assume { :end_inline_transmit3 } true; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11828: SUMMARY for call reset_delta_events(); srcloc: null [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11300: assume true;~t2_pc~0 := 1;~t2_st~0 := 2; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11300: assume !true; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1;calculate_output5_#t~ret18#1 := calculate_output6_#res#1;havoc calculate_output6_#t~ret19#1, calculate_output6_~input#1;havoc calculate_output6_#in~input#1;assume { :end_inline_calculate_output6 } true;assume -2147483648 <= calculate_output5_#t~ret18#1 && calculate_output5_#t~ret18#1 <= 2147483647;calculate_output5_#res#1 := calculate_output5_#t~ret18#1;havoc calculate_output5_#t~ret18#1; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11831: assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_4~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11831: assume !true; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11835: havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_4~0#1, eval_~tmp~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; [2025-02-07 21:38:22,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11308: ~token~0 := 1 + ~token~0;~E_3~0 := 1; [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11310-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11310: ~E_3~0 := 2; [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11839-1: SUMMARY for call update_channels(); srcloc: null [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11839: start_simulation_~kernel_st~0#1 := 3; [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11843: SUMMARY for call fire_delta_events(); srcloc: null [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11844: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11845: SUMMARY for call reset_delta_events(); srcloc: null [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11848: assume -2147483648 <= start_simulation_#t~ret38#1 && start_simulation_#t~ret38#1 <= 2147483647;start_simulation_~tmp~3#1 := start_simulation_#t~ret38#1;havoc start_simulation_#t~ret38#1; [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11848-1: SUMMARY for call start_simulation_#t~ret38#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:38:22,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1;calculate_output3_#t~ret16#1 := calculate_output4_#res#1;havoc calculate_output4_#t~ret17#1, calculate_output4_~input#1;havoc calculate_output4_#in~input#1;assume { :end_inline_calculate_output4 } true;assume -2147483648 <= calculate_output3_#t~ret16#1 && calculate_output3_#t~ret16#1 <= 2147483647;calculate_output3_#res#1 := calculate_output3_#t~ret16#1;havoc calculate_output3_#t~ret16#1; [2025-02-07 21:38:22,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1;main1_#t~ret22#1 := calculate_output_#res#1;havoc calculate_output_#t~ret14#1, calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~output~0#1 := main1_#t~ret22#1;havoc main1_~input~0#1;havoc main1_#t~ret22#1; [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11850: assume 0 == start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 4;assume { :begin_inline_fire_time_events } true;~M_E~0 := 1; [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11850: assume !(0 == start_simulation_~tmp~3#1); [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11853: assume { :end_inline_fire_time_events } true; [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11325: assume 0 == ~t3_pc~0; [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11325: assume !(0 == ~t3_pc~0); [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11854-1: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11854: assume { :begin_inline_reset_time_events } true; [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11855: assume { :end_inline_reset_time_events } true; [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11328: assume 1 == ~t3_pc~0; [2025-02-07 21:38:22,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11328: assume !(1 == ~t3_pc~0); [2025-02-07 21:38:23,012 INFO L? ?]: Removed 3297 outVars from TransFormulas that were not future-live. [2025-02-07 21:38:23,012 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:38:23,070 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:38:23,072 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:38:23,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:38:23 BoogieIcfgContainer [2025-02-07 21:38:23,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:38:23,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:38:23,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:38:23,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:38:23,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:38:12" (1/3) ... [2025-02-07 21:38:23,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60056c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:38:23, skipping insertion in model container [2025-02-07 21:38:23,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:38:15" (2/3) ... [2025-02-07 21:38:23,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60056c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:38:23, skipping insertion in model container [2025-02-07 21:38:23,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:38:23" (3/3) ... [2025-02-07 21:38:23,084 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.03.cil-2.c [2025-02-07 21:38:23,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:38:23,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label41+token_ring.03.cil-2.c that has 7 procedures, 2186 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-02-07 21:38:23,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:38:23,379 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;@f38687f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:38:23,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:38:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 2127 states, 2115 states have (on average 1.8988179669030734) internal successors, (4016), 2126 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:38:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-07 21:38:23,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:38:23,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:38:23,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:38:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:38:23,549 INFO L85 PathProgramCache]: Analyzing trace with hash 953885914, now seen corresponding path program 1 times [2025-02-07 21:38:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:38:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768181955] [2025-02-07 21:38:23,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:38:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:38:23,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-07 21:38:24,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-07 21:38:24,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:38:24,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:38:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:38:25,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:38:25,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768181955] [2025-02-07 21:38:25,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768181955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:38:25,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:38:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:38:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673369775] [2025-02-07 21:38:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:38:25,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:38:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:38:25,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:38:25,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:38:25,771 INFO L87 Difference]: Start difference. First operand has 2127 states, 2115 states have (on average 1.8988179669030734) internal successors, (4016), 2126 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 822.5) internal successors, (1645), 2 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:38:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:38:25,878 INFO L93 Difference]: Finished difference Result 2191 states and 4139 transitions. [2025-02-07 21:38:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:38:25,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 822.5) internal successors, (1645), 2 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1645 [2025-02-07 21:38:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:38:25,905 INFO L225 Difference]: With dead ends: 2191 [2025-02-07 21:38:25,906 INFO L226 Difference]: Without dead ends: 1646 [2025-02-07 21:38:25,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:38:25,915 INFO L435 NwaCegarLoop]: 3952 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:38:25,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:38:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2025-02-07 21:38:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2025-02-07 21:38:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1645 states have (on average 1.0) internal successors, (1645), 1645 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:38:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1645 transitions. [2025-02-07 21:38:26,007 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1645 transitions. Word has length 1645 [2025-02-07 21:38:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:38:26,011 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 1645 transitions. [2025-02-07 21:38:26,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 822.5) internal successors, (1645), 2 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:38:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1645 transitions. [2025-02-07 21:38:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-07 21:38:26,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:38:26,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:38:26,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:38:26,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:38:26,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:38:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1847479975, now seen corresponding path program 1 times [2025-02-07 21:38:26,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:38:26,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495945591] [2025-02-07 21:38:26,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:38:26,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:38:26,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-07 21:38:26,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-07 21:38:26,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:38:26,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:38:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:38:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:38:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495945591] [2025-02-07 21:38:28,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495945591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:38:28,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:38:28,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:38:28,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250721151] [2025-02-07 21:38:28,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:38:28,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:38:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:38:28,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:38:28,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:38:28,604 INFO L87 Difference]: Start difference. First operand 1646 states and 1645 transitions. Second operand has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 2 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:38:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:38:30,486 INFO L93 Difference]: Finished difference Result 1646 states and 1645 transitions. [2025-02-07 21:38:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:38:30,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 2 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1645 [2025-02-07 21:38:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:38:30,493 INFO L225 Difference]: With dead ends: 1646 [2025-02-07 21:38:30,493 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:38:30,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:38:30,495 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-07 21:38:30,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-07 21:38:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:38:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:38:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:38:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:38:30,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1645 [2025-02-07 21:38:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:38:30,499 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:38:30,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 2 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:38:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:38:30,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:38:30,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:38:30,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:38:30,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:38:30,505 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:38:30,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:38:30,529 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:38:30,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:38:30 BoogieIcfgContainer [2025-02-07 21:38:30,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:38:30,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:38:30,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:38:30,547 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:38:30,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:38:23" (3/4) ... [2025-02-07 21:38:30,550 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:38:30,556 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-02-07 21:38:30,556 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2025-02-07 21:38:30,556 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-02-07 21:38:30,556 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-02-07 21:38:30,556 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-02-07 21:38:30,556 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-02-07 21:38:30,647 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-07 21:38:30,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 21:38:30,672 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:38:30,678 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:38:31,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:38:31,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:38:31,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:38:31,116 INFO L158 Benchmark]: Toolchain (without parser) took 18554.62ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 79.4MB in the beginning and 601.3MB in the end (delta: -521.9MB). Peak memory consumption was 521.3MB. Max. memory is 16.1GB. [2025-02-07 21:38:31,116 INFO L158 Benchmark]: CDTParser took 1.39ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:38:31,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2604.65ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 79.4MB in the beginning and 166.2MB in the end (delta: -86.8MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2025-02-07 21:38:31,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 400.85ms. Allocated memory is still 302.0MB. Free memory was 166.2MB in the beginning and 89.6MB in the end (delta: 76.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-02-07 21:38:31,117 INFO L158 Benchmark]: Boogie Preprocessor took 432.33ms. Allocated memory is still 302.0MB. Free memory was 89.6MB in the beginning and 117.0MB in the end (delta: -27.4MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2025-02-07 21:38:31,117 INFO L158 Benchmark]: IcfgBuilder took 7069.53ms. Allocated memory was 302.0MB in the beginning and 604.0MB in the end (delta: 302.0MB). Free memory was 117.0MB in the beginning and 132.3MB in the end (delta: -15.2MB). Peak memory consumption was 345.2MB. Max. memory is 16.1GB. [2025-02-07 21:38:31,118 INFO L158 Benchmark]: TraceAbstraction took 7472.55ms. Allocated memory was 604.0MB in the beginning and 864.0MB in the end (delta: 260.0MB). Free memory was 132.3MB in the beginning and 390.4MB in the end (delta: -258.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:38:31,118 INFO L158 Benchmark]: Witness Printer took 568.09ms. Allocated memory is still 864.0MB. Free memory was 390.4MB in the beginning and 601.3MB in the end (delta: -210.9MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2025-02-07 21:38:31,119 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2604.65ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 79.4MB in the beginning and 166.2MB in the end (delta: -86.8MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 400.85ms. Allocated memory is still 302.0MB. Free memory was 166.2MB in the beginning and 89.6MB in the end (delta: 76.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 432.33ms. Allocated memory is still 302.0MB. Free memory was 89.6MB in the beginning and 117.0MB in the end (delta: -27.4MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * IcfgBuilder took 7069.53ms. Allocated memory was 302.0MB in the beginning and 604.0MB in the end (delta: 302.0MB). Free memory was 117.0MB in the beginning and 132.3MB in the end (delta: -15.2MB). Peak memory consumption was 345.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7472.55ms. Allocated memory was 604.0MB in the beginning and 864.0MB in the end (delta: 260.0MB). Free memory was 132.3MB in the beginning and 390.4MB in the end (delta: -258.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 568.09ms. Allocated memory is still 864.0MB. Free memory was 390.4MB in the beginning and 601.3MB in the end (delta: -210.9MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10998]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 11173]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 2186 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 3956 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1639 IncrementalHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 3956 mSDtfsCounter, 1639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2127occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3290 NumberOfCodeBlocks, 3290 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3288 ConstructedInterpolants, 0 QuantifiedInterpolants, 6574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 11150]: Location Invariant Derived location invariant: (a2 <= 10) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:38:31,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE