./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/stateful_check.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/stateful_check.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:14:08,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:14:08,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:14:08,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:14:08,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:14:08,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:14:08,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:14:08,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:14:08,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:14:08,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:14:08,104 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:14:08,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:14:08,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:14:08,105 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:14:08,105 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:14:08,106 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:14:08,106 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:14:08,106 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:14:08,106 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:14:08,106 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:14:08,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:14:08,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:14:08,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:14:08,108 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:14:08,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:14:08,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:14:08,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:14:08,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:14:08,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:14:08,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:14:08,108 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:14:08,108 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/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 -> 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e [2025-03-09 07:14:08,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:14:08,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:14:08,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:14:08,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:14:08,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:14:08,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/stateful_check.c [2025-03-09 07:14:09,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c69b889/975aa79ccfc6419aadafae2783f4eb24/FLAGd80abb537 [2025-03-09 07:14:09,776 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:14:09,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2025-03-09 07:14:09,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c69b889/975aa79ccfc6419aadafae2783f4eb24/FLAGd80abb537 [2025-03-09 07:14:10,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c69b889/975aa79ccfc6419aadafae2783f4eb24 [2025-03-09 07:14:10,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:14:10,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:14:10,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:14:10,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:14:10,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:14:10,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f677aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10, skipping insertion in model container [2025-03-09 07:14:10,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:14:10,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:14:10,280 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:14:10,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:14:10,299 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:14:10,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10 WrapperNode [2025-03-09 07:14:10,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:14:10,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:14:10,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:14:10,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:14:10,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,326 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 16, calls inlined = 22, statements flattened = 124 [2025-03-09 07:14:10,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:14:10,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:14:10,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:14:10,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:14:10,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 07:14:10,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:14:10,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:14:10,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:14:10,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:14:10,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (1/1) ... [2025-03-09 07:14:10,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:10,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:10,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:10,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:14:10,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:14:10,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:14:10,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:14:10,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:14:10,455 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:14:10,456 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:14:10,626 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-09 07:14:10,626 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:14:10,632 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:14:10,633 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:14:10,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:14:10 BoogieIcfgContainer [2025-03-09 07:14:10,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:14:10,634 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:14:10,634 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:14:10,638 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:14:10,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:14:10,638 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:14:10" (1/3) ... [2025-03-09 07:14:10,639 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2abfc68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:14:10, skipping insertion in model container [2025-03-09 07:14:10,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:14:10,639 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:10" (2/3) ... [2025-03-09 07:14:10,639 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2abfc68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:14:10, skipping insertion in model container [2025-03-09 07:14:10,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:14:10,640 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:14:10" (3/3) ... [2025-03-09 07:14:10,640 INFO L363 chiAutomizerObserver]: Analyzing ICFG stateful_check.c [2025-03-09 07:14:10,672 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:14:10,672 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:14:10,672 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:14:10,672 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:14:10,672 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:14:10,673 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:14:10,673 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:14:10,673 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:14:10,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 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-03-09 07:14:10,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-03-09 07:14:10,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:10,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:10,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:14:10,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 07:14:10,689 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:14:10,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 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-03-09 07:14:10,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-03-09 07:14:10,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:10,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:10,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:14:10,691 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 07:14:10,695 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(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0;" "main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1;" [2025-03-09 07:14:10,695 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet6#1;" "assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_#t~switch8#1 := 0 == main_#t~nondet7#1;" "assume main_#t~switch8#1;" "assume !(0 == main_~ldv_s_misc_fops_file_operations~0#1);" "havoc main_#t~nondet7#1;havoc main_#t~switch8#1;havoc main_#t~nondet7#1;havoc main_#t~switch8#1;" [2025-03-09 07:14:10,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash 121113, now seen corresponding path program 1 times [2025-03-09 07:14:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920909294] [2025-03-09 07:14:10,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:10,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:10,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:10,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:10,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:10,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:10,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:10,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:10,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:10,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash 111616842, now seen corresponding path program 1 times [2025-03-09 07:14:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437727355] [2025-03-09 07:14:10,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:10,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:14:10,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:14:10,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:10,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:10,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:10,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:14:10,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:14:10,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:10,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:10,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:10,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1406744882, now seen corresponding path program 1 times [2025-03-09 07:14:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697716444] [2025-03-09 07:14:10,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:10,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:10,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:14:10,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:14:10,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:10,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697716444] [2025-03-09 07:14:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697716444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:14:10,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:14:10,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:14:10,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700529774] [2025-03-09 07:14:10,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:14:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:10,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:14:10,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:14:10,953 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-03-09 07:14:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:10,992 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2025-03-09 07:14:10,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 79 transitions. [2025-03-09 07:14:10,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-03-09 07:14:11,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 46 states and 62 transitions. [2025-03-09 07:14:11,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-03-09 07:14:11,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-03-09 07:14:11,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2025-03-09 07:14:11,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:11,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-09 07:14:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2025-03-09 07:14:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-09 07:14:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-03-09 07:14:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-03-09 07:14:11,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-09 07:14:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:14:11,027 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-09 07:14:11,028 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:14:11,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2025-03-09 07:14:11,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-03-09 07:14:11,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:11,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:11,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:14:11,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:14:11,031 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(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0;" "main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1;" [2025-03-09 07:14:11,031 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet6#1;" "assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_#t~switch8#1 := 0 == main_#t~nondet7#1;" "assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1 == main_#t~nondet7#1;" "assume main_#t~switch8#1;" "assume !(1 == main_~ldv_s_misc_fops_file_operations~0#1);" "havoc main_#t~nondet7#1;havoc main_#t~switch8#1;havoc main_#t~nondet7#1;havoc main_#t~switch8#1;" [2025-03-09 07:14:11,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 121113, now seen corresponding path program 2 times [2025-03-09 07:14:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746668345] [2025-03-09 07:14:11,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:14:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:11,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:11,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:11,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:14:11,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:11,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:11,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:11,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:11,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:11,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:11,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:11,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -834794376, now seen corresponding path program 1 times [2025-03-09 07:14:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:11,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064566219] [2025-03-09 07:14:11,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:11,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:11,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:14:11,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:14:11,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:11,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:11,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:11,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:14:11,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:14:11,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:11,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:11,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:11,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash 659469200, now seen corresponding path program 1 times [2025-03-09 07:14:11,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:11,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026800838] [2025-03-09 07:14:11,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:11,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:11,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:14:11,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:14:11,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:11,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:11,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:11,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:14:11,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:14:11,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:11,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:11,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:11,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:11,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:11,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:11,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:11,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:11,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:11,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:11,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:11,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:11,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:14:11 BoogieIcfgContainer [2025-03-09 07:14:11,315 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:14:11,315 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:14:11,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:14:11,316 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:14:11,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:14:10" (3/4) ... [2025-03-09 07:14:11,317 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 07:14:11,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 07:14:11,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:14:11,339 INFO L158 Benchmark]: Toolchain (without parser) took 1180.29ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 36.2MB in the end (delta: 69.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 07:14:11,340 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:14:11,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.16ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 95.3MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:14:11,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.65ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:14:11,340 INFO L158 Benchmark]: Boogie Preprocessor took 20.73ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:14:11,340 INFO L158 Benchmark]: IcfgBuilder took 285.20ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 78.5MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:14:11,340 INFO L158 Benchmark]: BuchiAutomizer took 681.05ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 38.4MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 07:14:11,341 INFO L158 Benchmark]: Witness Printer took 23.52ms. Allocated memory is still 142.6MB. Free memory was 38.4MB in the beginning and 36.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:14:11,342 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.27ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.16ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 95.3MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.65ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.73ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 285.20ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 78.5MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 681.05ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 38.4MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 23.52ms. Allocated memory is still 142.6MB. Free memory was 38.4MB in the beginning and 36.2MB in the end (delta: 2.1MB). 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 46 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 51 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 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: 78]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L11] int ldv_mutex = 1; [L13] int open_called = 0; VAL [ldv_mutex=1, open_called=0] [L76] int ldv_s_misc_fops_file_operations = 0; [L77] CALL my_init() [L71] open_called = 0 [L72] return 0; VAL [ldv_mutex=1, open_called=0] [L77] RET my_init() Loop: [L78] COND TRUE __VERIFIER_nondet_int() [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 78]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L11] int ldv_mutex = 1; [L13] int open_called = 0; VAL [ldv_mutex=1, open_called=0] [L76] int ldv_s_misc_fops_file_operations = 0; [L77] CALL my_init() [L71] open_called = 0 [L72] return 0; VAL [ldv_mutex=1, open_called=0] [L77] RET my_init() Loop: [L78] COND TRUE __VERIFIER_nondet_int() [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 07:14:11,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)