./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/psyco/psyco_security.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc 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/psyco/psyco_security.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 c03d27deb00d6c25e1f99c43455f6da27475e88a721be2a7236bfffedf5da1e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:26:09,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:26:09,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:26:09,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:26:09,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:26:09,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:26:09,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:26:09,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:26:09,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:26:09,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:26:09,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:26:09,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:26:09,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:26:09,559 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:26:09,559 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:26:09,559 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:26:09,559 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:26:09,559 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:26:09,559 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:26:09,559 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:26:09,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:26:09,560 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:26:09,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:26:09,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:26:09,561 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:26:09,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:26:09,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:26:09,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:26:09,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:26:09,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:26:09,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:26:09,562 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:26:09,562 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 -> c03d27deb00d6c25e1f99c43455f6da27475e88a721be2a7236bfffedf5da1e8 [2025-02-06 19:26:09,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:26:09,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:26:09,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:26:09,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:26:09,800 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:26:09,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_security.c [2025-02-06 19:26:11,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba0737030/5e73647e347f4d9288bda1d3b2265f65/FLAG293a14e0b [2025-02-06 19:26:11,219 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:26:11,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_security.c [2025-02-06 19:26:11,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba0737030/5e73647e347f4d9288bda1d3b2265f65/FLAG293a14e0b [2025-02-06 19:26:11,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba0737030/5e73647e347f4d9288bda1d3b2265f65 [2025-02-06 19:26:11,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:26:11,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:26:11,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:26:11,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:26:11,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:26:11,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b96a6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11, skipping insertion in model container [2025-02-06 19:26:11,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:26:11,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:26:11,419 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:26:11,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:26:11,451 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:26:11,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11 WrapperNode [2025-02-06 19:26:11,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:26:11,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:26:11,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:26:11,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:26:11,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,479 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 267 [2025-02-06 19:26:11,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:26:11,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:26:11,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:26:11,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:26:11,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,498 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-06 19:26:11,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:26:11,506 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:26:11,506 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:26:11,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:26:11,507 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (1/1) ... [2025-02-06 19:26:11,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:26:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:26:11,531 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-06 19:26:11,542 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-06 19:26:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:26:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:26:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:26:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:26:11,602 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:26:11,603 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:26:11,818 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-06 19:26:11,818 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:26:11,827 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:26:11,827 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:26:11,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:26:11 BoogieIcfgContainer [2025-02-06 19:26:11,827 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:26:11,828 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:26:11,828 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:26:11,832 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:26:11,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:26:11,832 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:26:11" (1/3) ... [2025-02-06 19:26:11,833 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76858317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:26:11, skipping insertion in model container [2025-02-06 19:26:11,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:26:11,833 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:26:11" (2/3) ... [2025-02-06 19:26:11,833 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76858317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:26:11, skipping insertion in model container [2025-02-06 19:26:11,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:26:11,833 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:26:11" (3/3) ... [2025-02-06 19:26:11,834 INFO L363 chiAutomizerObserver]: Analyzing ICFG psyco_security.c [2025-02-06 19:26:11,866 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:26:11,866 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:26:11,866 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:26:11,866 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:26:11,866 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:26:11,866 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:26:11,866 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:26:11,866 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:26:11,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 76 states have internal predecessors, (145), 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-06 19:26:11,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2025-02-06 19:26:11,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:26:11,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:26:11,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:26:11,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:26:11,890 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:26:11,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 76 states have internal predecessors, (145), 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-06 19:26:11,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2025-02-06 19:26:11,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:26:11,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:26:11,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:26:11,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:26:11,898 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);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0;" [2025-02-06 19:26:11,899 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(0 == main_~q~0#1);" "assume !(1 == main_~q~0#1);" "assume !(2 == main_~q~0#1);" "assume !(3 == main_~q~0#1);" "assume !(4 == main_~q~0#1);" [2025-02-06 19:26:11,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:26:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash 9440, now seen corresponding path program 1 times [2025-02-06 19:26:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:26:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145843605] [2025-02-06 19:26:11,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:26:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:26:11,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:26:11,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:26:11,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:11,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:11,977 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:26:11,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:26:11,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:26:11,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:11,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:26:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:26:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash 47041298, now seen corresponding path program 1 times [2025-02-06 19:26:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:26:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990624900] [2025-02-06 19:26:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:26:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:26:12,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:26:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:26:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:26:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:26:12,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:26:12,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:26:12,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:26:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2008059057, now seen corresponding path program 1 times [2025-02-06 19:26:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:26:12,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065286688] [2025-02-06 19:26:12,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:26:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:26:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:26:12,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:26:12,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:26:12,101 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-06 19:26:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:26:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065286688] [2025-02-06 19:26:12,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065286688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:26:12,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:26:12,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:26:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052465258] [2025-02-06 19:26:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:26:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:26:12,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:26:12,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:26:12,175 INFO L87 Difference]: Start difference. First operand has 77 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 76 states have internal predecessors, (145), 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-02-06 19:26:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:26:12,224 INFO L93 Difference]: Finished difference Result 78 states and 120 transitions. [2025-02-06 19:26:12,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 120 transitions. [2025-02-06 19:26:12,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2025-02-06 19:26:12,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 57 states and 79 transitions. [2025-02-06 19:26:12,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-02-06 19:26:12,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-02-06 19:26:12,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 79 transitions. [2025-02-06 19:26:12,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:26:12,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-02-06 19:26:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 79 transitions. [2025-02-06 19:26:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 19:26:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 56 states have internal predecessors, (79), 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-06 19:26:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2025-02-06 19:26:12,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-02-06 19:26:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:26:12,254 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-02-06 19:26:12,254 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:26:12,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 79 transitions. [2025-02-06 19:26:12,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2025-02-06 19:26:12,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:26:12,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:26:12,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:26:12,255 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:26:12,255 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);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0;" "assume true;" [2025-02-06 19:26:12,256 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_~q~0#1;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" [2025-02-06 19:26:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:26:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash 292902, now seen corresponding path program 1 times [2025-02-06 19:26:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:26:12,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294624088] [2025-02-06 19:26:12,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:26:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:26:12,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:26:12,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:26:12,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:26:12,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:26:12,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:26:12,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:26:12,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:26:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash 9280, now seen corresponding path program 1 times [2025-02-06 19:26:12,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:26:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269716099] [2025-02-06 19:26:12,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:26:12,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:26:12,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:26:12,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:26:12,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,275 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:26:12,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:26:12,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:26:12,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:26:12,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:26:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash 281487141, now seen corresponding path program 1 times [2025-02-06 19:26:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:26:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97231352] [2025-02-06 19:26:12,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:26:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:26:12,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:26:12,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:26:12,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:26:12,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:26:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:26:12,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:26:12,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:26:12,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:26:12,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:26:12,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:26:12,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:26:12,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:26:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:26:12,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:26:12 BoogieIcfgContainer [2025-02-06 19:26:12,491 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:26:12,492 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:26:12,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:26:12,492 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:26:12,493 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:26:11" (3/4) ... [2025-02-06 19:26:12,494 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:26:12,519 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:26:12,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:26:12,522 INFO L158 Benchmark]: Toolchain (without parser) took 1258.48ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 38.7MB in the end (delta: 85.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-02-06 19:26:12,523 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:26:12,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.08ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 111.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:26:12,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.81ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 109.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:26:12,523 INFO L158 Benchmark]: Boogie Preprocessor took 25.43ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 109.1MB in the end (delta: 737.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:26:12,524 INFO L158 Benchmark]: IcfgBuilder took 321.95ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 89.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:26:12,524 INFO L158 Benchmark]: BuchiAutomizer took 663.31ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 42.0MB in the end (delta: 47.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 19:26:12,526 INFO L158 Benchmark]: Witness Printer took 28.92ms. Allocated memory is still 167.8MB. Free memory was 42.0MB in the beginning and 38.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:26:12,527 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.26ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.08ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 111.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.81ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 109.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.43ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 109.1MB in the end (delta: 737.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 321.95ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 89.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 663.31ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 42.0MB in the end (delta: 47.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 28.92ms. Allocated memory is still 167.8MB. Free memory was 42.0MB in the beginning and 38.7MB in the end (delta: 3.2MB). 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 57 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. 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, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 117 mSDtfsCounter, 24 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: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L7] int m_initSign = 1; [L8] int m_initVerify = 2; [L9] int m_Signature = 3; [L10] int m_sign = 4; [L11] int m_verify = 5; [L12] int m_update = 6; VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5] [L17] int q = 0; [L18] int method_id; [L21] int this_state = 0; VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5, q=0, this_state=0] [L24] COND TRUE 1 VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5, q=0, this_state=0] Loop: [L29] COND TRUE q == 0 [L30] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int m_initSign = 1; [L8] int m_initVerify = 2; [L9] int m_Signature = 3; [L10] int m_sign = 4; [L11] int m_verify = 5; [L12] int m_update = 6; VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5] [L17] int q = 0; [L18] int method_id; [L21] int this_state = 0; VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5, q=0, this_state=0] [L24] COND TRUE 1 VAL [m_Signature=3, m_initSign=1, m_initVerify=2, m_sign=4, m_update=6, m_verify=5, q=0, this_state=0] Loop: [L29] COND TRUE q == 0 [L30] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-06 19:26:12,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)