./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:51:40,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:51:40,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:51:40,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:51:40,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:51:40,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:51:40,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:51:40,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:51:40,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:51:40,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:51:40,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:51:40,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:51:40,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:51:40,373 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:51:40,374 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:51:40,374 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:51:40,374 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:51:40,374 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:51:40,374 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:51:40,374 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:51:40,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:51:40,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:51:40,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:51:40,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:51:40,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:51:40,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:51:40,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:51:40,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:51:40,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:51:40,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:51:40,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:51:40,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:51:40,376 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:51:40,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:51:40,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:51:40,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:51:40,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:51:40,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:51:40,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:51:40,377 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:51:40,377 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2025-02-08 14:51:40,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:51:40,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:51:40,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:51:40,679 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:51:40,680 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:51:40,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2025-02-08 14:51:41,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a62e24d9/22b608ff2b4b458ba8698435938fee4d/FLAG46ff6e5a0 [2025-02-08 14:51:42,225 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:51:42,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2025-02-08 14:51:42,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a62e24d9/22b608ff2b4b458ba8698435938fee4d/FLAG46ff6e5a0 [2025-02-08 14:51:42,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a62e24d9/22b608ff2b4b458ba8698435938fee4d [2025-02-08 14:51:42,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:51:42,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:51:42,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:51:42,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:51:42,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:51:42,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,269 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.02 02:51:42, skipping insertion in model container [2025-02-08 14:51:42,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:51:42,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:51:42,588 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:51:42,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:51:42,694 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:51:42,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42 WrapperNode [2025-02-08 14:51:42,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:51:42,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:51:42,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:51:42,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:51:42,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,756 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 830 [2025-02-08 14:51:42,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:51:42,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:51:42,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:51:42,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:51:42,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,792 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-08 14:51:42,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:51:42,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:51:42,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:51:42,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:51:42,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (1/1) ... [2025-02-08 14:51:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:51:42,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:42,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:51:42,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:51:42,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:51:42,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:51:42,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:51:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:51:42,980 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:51:42,982 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:51:43,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L993: havoc s_memory_write_~i#1, s_memory_write_~v#1;havoc s_memory_write_#in~i#1, s_memory_write_#in~v#1;assume { :end_inline_s_memory_write } true;s_run_~rsp_status~1#1 := 1; [2025-02-08 14:51:43,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: assume { :end_inline_error } true; [2025-02-08 14:51:43,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: assume { :end_inline_error } true; [2025-02-08 14:51:43,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1325: assume 1 == ~s_run_pc~0; [2025-02-08 14:51:43,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1325: assume !(1 == ~s_run_pc~0); [2025-02-08 14:51:43,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259: havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;start_simulation_~kernel_st~0#1 := 3; [2025-02-08 14:51:43,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1326: assume 1 == ~c_read_rsp_ev~0;~s_run_st~0 := 0; [2025-02-08 14:51:43,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1326: assume !(1 == ~c_read_rsp_ev~0); [2025-02-08 14:51:43,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L897: s_run_~req_type~1#1 := ~req_t_type___0~0;s_run_~req_a~1#1 := ~req_t_a___0~0;s_run_~req_d~1#1 := ~req_t_d___0~0;s_run_~rsp_type~1#1 := ~rsp_t_type___0~0;s_run_~rsp_status~1#1 := ~rsp_t_status___0~0;s_run_~rsp_d~1#1 := ~rsp_t_d___0~0; [2025-02-08 14:51:43,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831: assume { :end_inline_error } true; [2025-02-08 14:51:43,727 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295: assume 5 == ~m_run_pc~0; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295: assume !(5 == ~m_run_pc~0); [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296: assume 1 == ~c_read_req_ev~0;~m_run_st~0 := 0; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296: assume !(1 == ~c_read_req_ev~0); [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: assume 1 == ~m_run_pc~0; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: assume !(1 == ~m_run_pc~0); [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264: assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264: assume !(1 == ~c_m_ev~0); [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: m_run_~req_type~0#1 := ~req_t_type~0;m_run_~req_a~0#1 := ~req_t_a~0;m_run_~req_d~0#1 := ~req_t_d~0;m_run_~rsp_type~0#1 := ~rsp_t_type~0;m_run_~rsp_status~0#1 := ~rsp_t_status~0;m_run_~rsp_d~0#1 := ~rsp_t_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L79: assume { :end_inline_error } true; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335: assume 0 == ~m_run_st~0; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335: assume !(0 == ~m_run_st~0); [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137: havoc m_run_~d~0#1, m_run_~a~0#1, m_run_~req_type~0#1, m_run_~req_a~0#1, m_run_~req_d~0#1, m_run_~rsp_type~0#1, m_run_~rsp_status~0#1, m_run_~rsp_d~0#1, m_run_~req_type___0~0#1, m_run_~req_a___0~0#1, m_run_~req_d___0~0#1, m_run_~rsp_type___0~0#1, m_run_~rsp_status___0~0#1, m_run_~rsp_d___0~0#1;assume { :end_inline_m_run } true; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1303: assume 6 == ~m_run_pc~0; [2025-02-08 14:51:43,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1303: assume !(6 == ~m_run_pc~0); [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1304: assume 1 == ~c_write_rsp_ev~0;~m_run_st~0 := 0; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1304: assume !(1 == ~c_write_rsp_ev~0); [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271: assume 2 == ~m_run_pc~0; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271: assume !(2 == ~m_run_pc~0); [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1338: assume 0 == ~s_run_st~0; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1338: assume !(0 == ~s_run_st~0); [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: assume 1 == ~c_read_req_ev~0;~m_run_st~0 := 0; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: assume !(1 == ~c_read_req_ev~0); [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: m_run_~req_type___0~0#1 := ~req_tt_type~0;m_run_~req_a___0~0#1 := ~req_tt_a~0;m_run_~req_d___0~0#1 := ~req_tt_d~0;m_run_~rsp_type___0~0#1 := ~rsp_tt_type~0;m_run_~rsp_status___0~0#1 := ~rsp_tt_status~0;m_run_~rsp_d___0~0#1 := ~rsp_tt_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: m_run_~req_type___0~0#1 := ~req_tt_type~0;m_run_~req_a___0~0#1 := ~req_tt_a~0;m_run_~req_d___0~0#1 := ~req_tt_d~0;m_run_~rsp_type___0~0#1 := ~rsp_tt_type~0;m_run_~rsp_status___0~0#1 := ~rsp_tt_status~0;m_run_~rsp_d___0~0#1 := ~rsp_tt_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume { :end_inline_error } true; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1279: assume 3 == ~m_run_pc~0; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1279: assume !(3 == ~m_run_pc~0); [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: assume 1 == ~c_write_rsp_ev~0;~m_run_st~0 := 0; [2025-02-08 14:51:43,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: assume !(1 == ~c_write_rsp_ev~0); [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: s_run_~req_type~1#1 := ~req_t_type___0~0;s_run_~req_a~1#1 := ~req_t_a___0~0;s_run_~req_d~1#1 := ~req_t_d___0~0;s_run_~rsp_type~1#1 := ~rsp_t_type___0~0;s_run_~rsp_status~1#1 := ~rsp_t_status___0~0;s_run_~rsp_d~1#1 := ~rsp_t_d___0~0; [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: assume 2 == ~s_run_pc~0; [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: assume !(2 == ~s_run_pc~0); [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1152: havoc s_run_#t~ret4#1, s_run_~req_type~1#1, s_run_~req_a~1#1, s_run_~req_d~1#1, s_run_~rsp_type~1#1, s_run_~rsp_status~1#1, s_run_~rsp_d~1#1, s_run_~dummy~0#1;assume { :end_inline_s_run } true; [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: s_run_#t~ret4#1 := s_memory_read_#res#1;havoc s_memory_read_~i#1, s_memory_read_~x~0#1;havoc s_memory_read_#in~i#1;assume { :end_inline_s_memory_read } true;s_run_~rsp_d~1#1 := s_run_#t~ret4#1;havoc s_run_#t~ret4#1;s_run_~rsp_status~1#1 := 1; [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1318: assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1318: assume !(1 == ~c_write_req_ev~0); [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: m_run_~req_type___0~0#1 := ~req_tt_type~0;m_run_~req_a___0~0#1 := ~req_tt_a~0;m_run_~req_d___0~0#1 := ~req_tt_d~0;m_run_~rsp_type___0~0#1 := ~rsp_tt_type~0;m_run_~rsp_status___0~0#1 := ~rsp_tt_status~0;m_run_~rsp_d___0~0#1 := ~rsp_tt_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287: assume 4 == ~m_run_pc~0; [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287: assume !(4 == ~m_run_pc~0); [2025-02-08 14:51:43,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1288: assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; [2025-02-08 14:51:43,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1288: assume !(1 == ~c_m_ev~0); [2025-02-08 14:51:43,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: m_run_~req_type~0#1 := ~req_t_type~0;m_run_~req_a~0#1 := ~req_t_a~0;m_run_~req_d~0#1 := ~req_t_d~0;m_run_~rsp_type~0#1 := ~rsp_t_type~0;m_run_~rsp_status~0#1 := ~rsp_t_status~0;m_run_~rsp_d~0#1 := ~rsp_t_d~0;m_run_~a~0#1 := ~a_t~0;m_run_~d~0#1 := ~d_t~0; [2025-02-08 14:51:43,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: m_run_~req_type~0#1 := ~req_t_type~0;m_run_~req_a~0#1 := ~req_t_a~0;m_run_~req_d~0#1 := ~req_t_d~0;m_run_~rsp_type~0#1 := ~rsp_t_type~0;m_run_~rsp_status~0#1 := ~rsp_t_status~0;m_run_~rsp_d~0#1 := ~rsp_t_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 14:51:43,753 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-02-08 14:51:43,754 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:51:43,766 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:51:43,767 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:51:43,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:43 BoogieIcfgContainer [2025-02-08 14:51:43,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:51:43,768 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:51:43,768 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:51:43,774 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:51:43,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:43,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:51:42" (1/3) ... [2025-02-08 14:51:43,776 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@717388f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:51:43, skipping insertion in model container [2025-02-08 14:51:43,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:43,776 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:42" (2/3) ... [2025-02-08 14:51:43,777 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@717388f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:51:43, skipping insertion in model container [2025-02-08 14:51:43,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:43,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:43" (3/3) ... [2025-02-08 14:51:43,778 INFO L363 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2025-02-08 14:51:43,841 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:51:43,841 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:51:43,841 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:51:43,842 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:51:43,842 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:51:43,842 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:51:43,842 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:51:43,842 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:51:43,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 294 states, 206 states have (on average 1.9320388349514563) internal successors, (398), 293 states have internal predecessors, (398), 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-08 14:51:43,872 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 164 [2025-02-08 14:51:43,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:43,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:43,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:43,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:51:43,881 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:51:43,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 294 states, 206 states have (on average 1.9320388349514563) internal successors, (398), 293 states have internal predecessors, (398), 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-08 14:51:43,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 164 [2025-02-08 14:51:43,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:43,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:43,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:43,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:51:43,896 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~m_run_i~0);~m_run_st~0 := 2;" "assume !(1 == ~s_run_i~0);~s_run_st~0 := 2;" "assume 1 == ~m_run_pc~0;" "assume 1 == ~c_m_ev~0;~m_run_st~0 := 0;" "assume 2 == ~s_run_pc~0;" "assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" [2025-02-08 14:51:43,897 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~m_run_st~0;" "assume !(0 == ~m_run_st~0);" "assume !(0 == ~s_run_st~0);" [2025-02-08 14:51:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1744473606, now seen corresponding path program 1 times [2025-02-08 14:51:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:43,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312212391] [2025-02-08 14:51:43,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:43,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:43,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:43,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:43,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:44,059 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-08 14:51:44,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:44,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312212391] [2025-02-08 14:51:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312212391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:44,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:44,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268756774] [2025-02-08 14:51:44,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:44,067 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:44,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash 17144229, now seen corresponding path program 1 times [2025-02-08 14:51:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627270561] [2025-02-08 14:51:44,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:51:44,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:51:44,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:44,086 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-08 14:51:44,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:44,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627270561] [2025-02-08 14:51:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627270561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:44,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:44,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:51:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343388997] [2025-02-08 14:51:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:44,088 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:44,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:44,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:44,112 INFO L87 Difference]: Start difference. First operand has 294 states, 206 states have (on average 1.9320388349514563) internal successors, (398), 293 states have internal predecessors, (398), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-08 14:51:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:44,169 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2025-02-08 14:51:44,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 133 transitions. [2025-02-08 14:51:44,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 50 states and 77 transitions. [2025-02-08 14:51:44,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-02-08 14:51:44,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-02-08 14:51:44,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 77 transitions. [2025-02-08 14:51:44,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:44,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 77 transitions. [2025-02-08 14:51:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 77 transitions. [2025-02-08 14:51:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-02-08 14:51:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.6) internal successors, (72), 44 states have internal predecessors, (72), 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-08 14:51:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2025-02-08 14:51:44,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 72 transitions. [2025-02-08 14:51:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:44,219 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 72 transitions. [2025-02-08 14:51:44,219 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:51:44,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 72 transitions. [2025-02-08 14:51:44,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:44,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:44,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:44,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-08 14:51:44,223 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume !(1 == ~s_run_i~0);~s_run_st~0 := 2;" "assume 1 == ~m_run_pc~0;" "assume 1 == ~c_m_ev~0;~m_run_st~0 := 0;" "assume 2 == ~s_run_pc~0;" "assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" [2025-02-08 14:51:44,224 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~m_run_st~0;" "assume 0 == ~m_run_st~0;havoc eval_#t~nondet5#1;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~s_run_st~0);" [2025-02-08 14:51:44,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1662990009, now seen corresponding path program 1 times [2025-02-08 14:51:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796799892] [2025-02-08 14:51:44,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:44,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:44,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:44,285 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-08 14:51:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796799892] [2025-02-08 14:51:44,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796799892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:44,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:44,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330173687] [2025-02-08 14:51:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:44,286 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:44,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 531480977, now seen corresponding path program 1 times [2025-02-08 14:51:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007376871] [2025-02-08 14:51:44,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:51:44,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:51:44,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,294 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:44,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:51:44,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:51:44,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:44,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:44,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:44,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:44,354 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-08 14:51:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:44,361 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2025-02-08 14:51:44,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 70 transitions. [2025-02-08 14:51:44,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 70 transitions. [2025-02-08 14:51:44,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-02-08 14:51:44,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-02-08 14:51:44,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 70 transitions. [2025-02-08 14:51:44,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:44,363 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 70 transitions. [2025-02-08 14:51:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 70 transitions. [2025-02-08 14:51:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 14:51:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 44 states have internal predecessors, (70), 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-08 14:51:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 70 transitions. [2025-02-08 14:51:44,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 70 transitions. [2025-02-08 14:51:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:44,368 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 70 transitions. [2025-02-08 14:51:44,368 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:51:44,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 70 transitions. [2025-02-08 14:51:44,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:44,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:44,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:44,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-08 14:51:44,369 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume 1 == ~s_run_i~0;~s_run_st~0 := 0;" "assume 1 == ~m_run_pc~0;" "assume 1 == ~c_m_ev~0;~m_run_st~0 := 0;" "assume 2 == ~s_run_pc~0;" "assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" [2025-02-08 14:51:44,369 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~m_run_st~0;" "assume 0 == ~m_run_st~0;havoc eval_#t~nondet5#1;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~s_run_st~0);" [2025-02-08 14:51:44,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1634360858, now seen corresponding path program 1 times [2025-02-08 14:51:44,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252059647] [2025-02-08 14:51:44,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:51:44,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:51:44,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:44,430 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-08 14:51:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252059647] [2025-02-08 14:51:44,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252059647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:44,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:44,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:44,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89094684] [2025-02-08 14:51:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:44,431 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:44,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash 531480977, now seen corresponding path program 2 times [2025-02-08 14:51:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464548362] [2025-02-08 14:51:44,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:44,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:51:44,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:51:44,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:44,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:44,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:51:44,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:51:44,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:44,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:44,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:44,462 INFO L87 Difference]: Start difference. First operand 45 states and 70 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-08 14:51:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:44,485 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2025-02-08 14:51:44,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2025-02-08 14:51:44,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 49 transitions. [2025-02-08 14:51:44,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-02-08 14:51:44,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-02-08 14:51:44,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 49 transitions. [2025-02-08 14:51:44,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:44,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-02-08 14:51:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 49 transitions. [2025-02-08 14:51:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 14:51:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 37 states have internal predecessors, (49), 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-08 14:51:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-02-08 14:51:44,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-02-08 14:51:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:44,491 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-02-08 14:51:44,492 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:51:44,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 49 transitions. [2025-02-08 14:51:44,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:44,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:44,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:44,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-08 14:51:44,493 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume 1 == ~s_run_i~0;~s_run_st~0 := 0;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume 2 == ~s_run_pc~0;" "assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0;" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" [2025-02-08 14:51:44,493 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~m_run_st~0;" "assume 0 == ~m_run_st~0;havoc eval_#t~nondet5#1;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~s_run_st~0);" [2025-02-08 14:51:44,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2104421243, now seen corresponding path program 1 times [2025-02-08 14:51:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362399294] [2025-02-08 14:51:44,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:44,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:44,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:44,584 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-08 14:51:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362399294] [2025-02-08 14:51:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362399294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824996923] [2025-02-08 14:51:44,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:44,585 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:51:44,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash 531480977, now seen corresponding path program 3 times [2025-02-08 14:51:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275014204] [2025-02-08 14:51:44,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:44,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:51:44,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:51:44,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:44,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:44,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:51:44,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:51:44,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:44,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:44,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:44,625 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-08 14:51:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:44,632 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2025-02-08 14:51:44,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2025-02-08 14:51:44,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 39 transitions. [2025-02-08 14:51:44,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-02-08 14:51:44,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-02-08 14:51:44,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2025-02-08 14:51:44,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:44,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-08 14:51:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2025-02-08 14:51:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 14:51:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-08 14:51:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-02-08 14:51:44,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-08 14:51:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:44,639 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-08 14:51:44,640 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:51:44,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2025-02-08 14:51:44,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:44,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:44,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:44,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-08 14:51:44,641 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume 1 == ~s_run_i~0;~s_run_st~0 := 0;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" [2025-02-08 14:51:44,641 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~m_run_st~0;" "assume 0 == ~m_run_st~0;havoc eval_#t~nondet5#1;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~s_run_st~0);" [2025-02-08 14:51:44,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2104420096, now seen corresponding path program 1 times [2025-02-08 14:51:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777106973] [2025-02-08 14:51:44,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:44,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:44,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:44,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:44,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:44,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:44,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash 531480977, now seen corresponding path program 4 times [2025-02-08 14:51:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972060955] [2025-02-08 14:51:44,672 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:44,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-02-08 14:51:44,676 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:51:44,676 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:51:44,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:44,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:51:44,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:51:44,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:44,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash 925855730, now seen corresponding path program 1 times [2025-02-08 14:51:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319312869] [2025-02-08 14:51:44,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:51:44,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:51:44,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:44,735 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-08 14:51:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319312869] [2025-02-08 14:51:44,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319312869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:44,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:44,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:51:44,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101551016] [2025-02-08 14:51:44,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:44,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:44,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:44,759 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-08 14:51:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:44,772 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-02-08 14:51:44,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2025-02-08 14:51:44,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 37 transitions. [2025-02-08 14:51:44,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-02-08 14:51:44,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-02-08 14:51:44,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 37 transitions. [2025-02-08 14:51:44,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:44,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-08 14:51:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 37 transitions. [2025-02-08 14:51:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 14:51:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-08 14:51:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-02-08 14:51:44,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-08 14:51:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:44,780 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-08 14:51:44,780 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:51:44,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2025-02-08 14:51:44,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:51:44,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:44,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:44,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:44,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:51:44,781 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume 1 == ~s_run_i~0;~s_run_st~0 := 0;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" "assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" [2025-02-08 14:51:44,781 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume 0 == ~m_run_st~0;" "assume 0 == ~m_run_st~0;havoc eval_#t~nondet5#1;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp~0#1);" "assume 0 == ~s_run_st~0;havoc eval_#t~nondet6#1;eval_~tmp___0~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1;" "assume !(0 != eval_~tmp___0~0#1);" [2025-02-08 14:51:44,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2104420096, now seen corresponding path program 2 times [2025-02-08 14:51:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586486342] [2025-02-08 14:51:44,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:44,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:44,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:44,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:44,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:44,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:44,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:44,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,821 INFO L85 PathProgramCache]: Analyzing trace with hash -703958755, now seen corresponding path program 1 times [2025-02-08 14:51:44,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530769490] [2025-02-08 14:51:44,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:51:44,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:51:44,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:44,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:51:44,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:51:44,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1363243300, now seen corresponding path program 1 times [2025-02-08 14:51:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290109388] [2025-02-08 14:51:44,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:44,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:44,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:51:44,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:51:44,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:44,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:51:44,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:51:44,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:44,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:44,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:45,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:45,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:45,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:45,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:45,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:51:45,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:51:45,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:45,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:46,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:51:46 BoogieIcfgContainer [2025-02-08 14:51:46,103 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:51:46,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:51:46,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:51:46,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:51:46,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:43" (3/4) ... [2025-02-08 14:51:46,107 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:51:46,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:51:46,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:51:46,190 INFO L158 Benchmark]: Toolchain (without parser) took 3929.55ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 85.8MB in the end (delta: 25.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-02-08 14:51:46,190 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:46,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.49ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 91.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:51:46,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.64ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:51:46,191 INFO L158 Benchmark]: Boogie Preprocessor took 62.91ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 86.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:46,191 INFO L158 Benchmark]: IcfgBuilder took 947.09ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 43.2MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 14:51:46,192 INFO L158 Benchmark]: BuchiAutomizer took 2335.29ms. Allocated memory is still 142.6MB. Free memory was 42.8MB in the beginning and 91.5MB in the end (delta: -48.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:46,192 INFO L158 Benchmark]: Witness Printer took 85.51ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 85.8MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:51:46,194 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.49ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 91.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.64ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.91ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 86.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 947.09ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 43.2MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 2335.29ms. Allocated memory is still 142.6MB. Free memory was 42.8MB in the beginning and 91.5MB in the end (delta: -48.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.51ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 85.8MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 182 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN3 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 1119]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L25] int m_run_st ; [L26] int m_run_i ; [L27] int m_run_pc ; [L28] int s_memory0 ; [L30] int s_run_st ; [L31] int s_run_i ; [L32] int s_run_pc ; [L33] int c_m_lock ; [L34] int c_m_ev ; [L35] int c_req_type ; [L36] int c_req_a ; [L37] int c_req_d ; [L38] int c_rsp_type ; [L39] int c_rsp_status ; [L40] int c_rsp_d ; [L41] int c_empty_req ; [L42] int c_empty_rsp ; [L43] int c_read_req_ev ; [L44] int c_write_req_ev ; [L45] int c_read_rsp_ev ; [L46] int c_write_rsp_ev ; [L47] static int d_t ; [L48] static int a_t ; [L49] static int req_t_type ; [L50] static int req_t_a ; [L51] static int req_t_d ; [L52] static int rsp_t_type ; [L53] static int rsp_t_status ; [L54] static int rsp_t_d ; [L55] static int req_tt_type ; [L56] static int req_tt_a ; [L57] static int req_tt_d ; [L58] static int rsp_tt_type ; [L59] static int rsp_tt_status ; [L60] static int rsp_tt_d ; [L845] static int req_t_type___0 ; [L846] static int req_t_a___0 ; [L847] static int req_t_d___0 ; [L848] static int rsp_t_type___0 ; [L849] static int rsp_t_status___0 ; [L850] static int rsp_t_d___0 ; [L1352] int __retres1 ; [L1356] c_m_lock = 0 [L1357] c_m_ev = 2 [L1359] m_run_i = 1 [L1360] m_run_pc = 0 [L1361] s_run_i = 1 [L1362] s_run_pc = 0 [L1363] c_empty_req = 1 [L1364] c_empty_rsp = 1 [L1365] c_read_req_ev = 2 [L1366] c_write_req_ev = 2 [L1367] c_read_rsp_ev = 2 [L1368] c_write_rsp_ev = 2 [L1369] c_m_lock = 0 [L1370] c_m_ev = 2 [L1371] CALL start_simulation() [L1168] int kernel_st ; [L1171] kernel_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1172] COND TRUE (int )m_run_i == 1 [L1173] m_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1177] COND TRUE (int )s_run_i == 1 [L1178] s_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1182] COND FALSE !((int )m_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1190] COND FALSE !((int )m_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1198] COND FALSE !((int )m_run_pc == 3) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1206] COND FALSE !((int )m_run_pc == 4) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1214] COND FALSE !((int )m_run_pc == 5) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1222] COND FALSE !((int )m_run_pc == 6) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1236] COND FALSE !((int )s_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1244] COND FALSE !((int )s_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1255] COND TRUE 1 [L1258] kernel_st = 1 [L1259] CALL eval() [L1114] int tmp ; [L1115] int tmp___0 ; VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] Loop: [L1119] COND TRUE 1 [L1121] COND TRUE (int )m_run_st == 0 [L1130] COND TRUE (int )m_run_st == 0 [L1132] tmp = __VERIFIER_nondet_int() [L1134] COND FALSE !(\read(tmp)) [L1145] COND TRUE (int )s_run_st == 0 [L1147] tmp___0 = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp___0)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1119]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int m_run_st ; [L26] int m_run_i ; [L27] int m_run_pc ; [L28] int s_memory0 ; [L30] int s_run_st ; [L31] int s_run_i ; [L32] int s_run_pc ; [L33] int c_m_lock ; [L34] int c_m_ev ; [L35] int c_req_type ; [L36] int c_req_a ; [L37] int c_req_d ; [L38] int c_rsp_type ; [L39] int c_rsp_status ; [L40] int c_rsp_d ; [L41] int c_empty_req ; [L42] int c_empty_rsp ; [L43] int c_read_req_ev ; [L44] int c_write_req_ev ; [L45] int c_read_rsp_ev ; [L46] int c_write_rsp_ev ; [L47] static int d_t ; [L48] static int a_t ; [L49] static int req_t_type ; [L50] static int req_t_a ; [L51] static int req_t_d ; [L52] static int rsp_t_type ; [L53] static int rsp_t_status ; [L54] static int rsp_t_d ; [L55] static int req_tt_type ; [L56] static int req_tt_a ; [L57] static int req_tt_d ; [L58] static int rsp_tt_type ; [L59] static int rsp_tt_status ; [L60] static int rsp_tt_d ; [L845] static int req_t_type___0 ; [L846] static int req_t_a___0 ; [L847] static int req_t_d___0 ; [L848] static int rsp_t_type___0 ; [L849] static int rsp_t_status___0 ; [L850] static int rsp_t_d___0 ; [L1352] int __retres1 ; [L1356] c_m_lock = 0 [L1357] c_m_ev = 2 [L1359] m_run_i = 1 [L1360] m_run_pc = 0 [L1361] s_run_i = 1 [L1362] s_run_pc = 0 [L1363] c_empty_req = 1 [L1364] c_empty_rsp = 1 [L1365] c_read_req_ev = 2 [L1366] c_write_req_ev = 2 [L1367] c_read_rsp_ev = 2 [L1368] c_write_rsp_ev = 2 [L1369] c_m_lock = 0 [L1370] c_m_ev = 2 [L1371] CALL start_simulation() [L1168] int kernel_st ; [L1171] kernel_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1172] COND TRUE (int )m_run_i == 1 [L1173] m_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1177] COND TRUE (int )s_run_i == 1 [L1178] s_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1182] COND FALSE !((int )m_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1190] COND FALSE !((int )m_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1198] COND FALSE !((int )m_run_pc == 3) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1206] COND FALSE !((int )m_run_pc == 4) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1214] COND FALSE !((int )m_run_pc == 5) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1222] COND FALSE !((int )m_run_pc == 6) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1236] COND FALSE !((int )s_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1244] COND FALSE !((int )s_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1255] COND TRUE 1 [L1258] kernel_st = 1 [L1259] CALL eval() [L1114] int tmp ; [L1115] int tmp___0 ; VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_run_i=1, s_run_pc=0, s_run_st=0] Loop: [L1119] COND TRUE 1 [L1121] COND TRUE (int )m_run_st == 0 [L1130] COND TRUE (int )m_run_st == 0 [L1132] tmp = __VERIFIER_nondet_int() [L1134] COND FALSE !(\read(tmp)) [L1145] COND TRUE (int )s_run_st == 0 [L1147] tmp___0 = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:51:46,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)