./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for termination
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/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/loop-lit/mine2017-ex4.8.i', '-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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72']
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/loop-lit/mine2017-ex4.8.i -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 ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-08 00:18:47,331 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 00:18:47,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2024-11-08 00:18:47,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 00:18:47,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 00:18:47,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 00:18:47,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 00:18:47,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 00:18:47,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 00:18:47,428 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 00:18:47,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 00:18:47,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 00:18:47,429 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 00:18:47,430 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-08 00:18:47,430 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-08 00:18:47,430 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-08 00:18:47,430 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-08 00:18:47,430 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-08 00:18:47,431 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-08 00:18:47,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 00:18:47,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-08 00:18:47,431 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 00:18:47,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 00:18:47,431 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 00:18:47,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 00:18:47,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-08 00:18:47,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-08 00:18:47,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-08 00:18:47,432 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 00:18:47,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 00:18:47,432 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 00:18:47,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 00:18:47,432 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-08 00:18:47,432 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 00:18:47,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 00:18:47,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 00:18:47,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 00:18:47,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 00:18:47,434 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-08 00:18:47,434 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 -> ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72
[2024-11-08 00:18:47,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 00:18:47,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 00:18:47,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 00:18:47,711 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 00:18:47,711 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 00:18:47,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i
[2024-11-08 00:18:48,888 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 00:18:49,126 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 00:18:49,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/mine2017-ex4.8.i
[2024-11-08 00:18:49,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5709f64dd/1be73641bb8b48269bf21cf2dd99976d/FLAGb3440e05a
[2024-11-08 00:18:49,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5709f64dd/1be73641bb8b48269bf21cf2dd99976d
[2024-11-08 00:18:49,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 00:18:49,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 00:18:49,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 00:18:49,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 00:18:49,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 00:18:49,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab9b1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49, skipping insertion in model container
[2024-11-08 00:18:49,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,495 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 00:18:49,600 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 00:18:49,608 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 00:18:49,618 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 00:18:49,631 INFO L204 MainTranslator]: Completed translation
[2024-11-08 00:18:49,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49 WrapperNode
[2024-11-08 00:18:49,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 00:18:49,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 00:18:49,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 00:18:49,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 00:18:49,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,654 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 37
[2024-11-08 00:18:49,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 00:18:49,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 00:18:49,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 00:18:49,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 00:18:49,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,669 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].
[2024-11-08 00:18:49,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 00:18:49,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 00:18:49,680 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 00:18:49,680 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 00:18:49,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (1/1) ...
[2024-11-08 00:18:49,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:49,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:49,704 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)
[2024-11-08 00:18:49,706 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
[2024-11-08 00:18:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 00:18:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 00:18:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 00:18:49,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 00:18:49,779 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 00:18:49,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 00:18:49,850 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2024-11-08 00:18:49,851 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 00:18:49,857 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 00:18:49,857 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 00:18:49,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:18:49 BoogieIcfgContainer
[2024-11-08 00:18:49,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 00:18:49,859 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-08 00:18:49,859 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-08 00:18:49,863 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-08 00:18:49,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:18:49,864 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 12:18:49" (1/3) ...
[2024-11-08 00:18:49,865 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c39d52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:18:49, skipping insertion in model container
[2024-11-08 00:18:49,865 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:18:49,866 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:49" (2/3) ...
[2024-11-08 00:18:49,866 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c39d52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:18:49, skipping insertion in model container
[2024-11-08 00:18:49,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:18:49,866 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:18:49" (3/3) ...
[2024-11-08 00:18:49,867 INFO L332 chiAutomizerObserver]: Analyzing ICFG mine2017-ex4.8.i
[2024-11-08 00:18:49,917 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-08 00:18:49,918 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-08 00:18:49,918 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-08 00:18:49,918 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-08 00:18:49,918 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-08 00:18:49,919 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-08 00:18:49,919 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-08 00:18:49,919 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-08 00:18:49,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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)
[2024-11-08 00:18:49,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2024-11-08 00:18:49,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:49,937 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:49,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:18:49,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:49,940 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-08 00:18:49,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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)
[2024-11-08 00:18:49,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2024-11-08 00:18:49,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:49,941 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:49,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:18:49,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:49,947 INFO L745 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0; 13#L20-2true
[2024-11-08 00:18:49,947 INFO L747 eck$LassoCheckResult]: Loop: 13#L20-2true havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 15#L17-1true assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11#L13true assume !(0 == __VERIFIER_assert_~cond#1); 5#L13-3true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 16#L13-4true assume !(0 == __VERIFIER_assert_~cond#1); 9#L13-7true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 17#L20true assume !(0 == main_~v~0#1); 13#L20-2true
[2024-11-08 00:18:49,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2024-11-08 00:18:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:49,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665397981]
[2024-11-08 00:18:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:50,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash -266161209, now seen corresponding path program 1 times
[2024-11-08 00:18:50,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:50,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882509772]
[2024-11-08 00:18:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1280135621, now seen corresponding path program 1 times
[2024-11-08 00:18:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126043233]
[2024-11-08 00:18:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:50,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126043233]
[2024-11-08 00:18:50,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126043233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 00:18:50,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 00:18:50,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 00:18:50,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463199593]
[2024-11-08 00:18:50,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 00:18:50,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 00:18:50,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 00:18:50,256 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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)
[2024-11-08 00:18:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:50,274 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions.
[2024-11-08 00:18:50,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions.
[2024-11-08 00:18:50,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-08 00:18:50,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 16 states and 17 transitions.
[2024-11-08 00:18:50,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16
[2024-11-08 00:18:50,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16
[2024-11-08 00:18:50,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions.
[2024-11-08 00:18:50,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 00:18:50,282 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions.
[2024-11-08 00:18:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions.
[2024-11-08 00:18:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2024-11-08 00:18:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions.
[2024-11-08 00:18:50,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions.
[2024-11-08 00:18:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 00:18:50,305 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions.
[2024-11-08 00:18:50,306 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-08 00:18:50,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions.
[2024-11-08 00:18:50,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-08 00:18:50,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:50,307 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:50,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:50,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:50,307 INFO L745 eck$LassoCheckResult]: Stem: 67#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 68#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0; 69#L20-2 havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 75#L17-1 assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74#L13 assume !(0 == __VERIFIER_assert_~cond#1); 73#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 72#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 71#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 70#L20 assume 0 == main_~v~0#1;main_~v~0#1 := 1; 64#L20-2
[2024-11-08 00:18:50,307 INFO L747 eck$LassoCheckResult]: Loop: 64#L20-2 havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 65#L17-1 assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62#L13 assume !(0 == __VERIFIER_assert_~cond#1); 63#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 66#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 60#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 61#L20 assume !(0 == main_~v~0#1); 64#L20-2
[2024-11-08 00:18:50,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1280135619, now seen corresponding path program 1 times
[2024-11-08 00:18:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:50,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733341000]
[2024-11-08 00:18:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:50,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash -266161209, now seen corresponding path program 2 times
[2024-11-08 00:18:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:50,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937968302]
[2024-11-08 00:18:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1693695035, now seen corresponding path program 1 times
[2024-11-08 00:18:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:50,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695257459]
[2024-11-08 00:18:50,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:50,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.11 12:18:50 BoogieIcfgContainer
[2024-11-08 00:18:50,685 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-11-08 00:18:50,686 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 00:18:50,686 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 00:18:50,686 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 00:18:50,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:18:49" (3/4) ...
[2024-11-08 00:18:50,688 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample
[2024-11-08 00:18:50,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-08 00:18:50,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 00:18:50,712 INFO L158 Benchmark]: Toolchain (without parser) took 1231.02ms. Allocated memory is still 142.6MB. Free memory was 117.1MB in the beginning and 110.3MB in the end (delta: 6.7MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB.
[2024-11-08 00:18:50,712 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:18:50,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.59ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 106.6MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-08 00:18:50,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.13ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 105.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:18:50,713 INFO L158 Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 104.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:18:50,713 INFO L158 Benchmark]: RCFGBuilder took 178.09ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 94.9MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-08 00:18:50,713 INFO L158 Benchmark]: BuchiAutomizer took 826.22ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 112.6MB in the end (delta: -17.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:18:50,714 INFO L158 Benchmark]: Witness Printer took 25.73ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 110.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:18:50,715 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.55ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 150.59ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 106.6MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 21.13ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 105.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 21.49ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 104.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 178.09ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 94.9MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* BuchiAutomizer took 826.22ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 112.6MB in the end (delta: -17.9MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 25.73ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 110.3MB in the end (delta: 2.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 16 locations.
- StatisticsResult: Timing statistics
BüchiAutomizer plugin needed 0.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. 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, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 15 mSDtfsCounter, 8 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: 17]: Nontermination argument in form of an infinite program execution.
Nontermination argument in form of an infinite program execution.
Stem:
[L16] int v = 0;
VAL [v=0]
[L17] COND TRUE __VERIFIER_nondet_bool() == 0
[L18] CALL __VERIFIER_assert(0 <= v)
[L13] COND FALSE !(!(cond))
[L18] RET __VERIFIER_assert(0 <= v)
[L19] CALL __VERIFIER_assert(v <= 1)
[L13] COND FALSE !(!(cond))
[L19] RET __VERIFIER_assert(v <= 1)
[L20] COND TRUE v == 0
[L21] v = 1
VAL [v=1]
Loop:
[L17] COND TRUE __VERIFIER_nondet_bool() == 0
[L18] CALL __VERIFIER_assert(0 <= v)
[L13] COND FALSE !(!(cond))
[L18] RET __VERIFIER_assert(0 <= v)
[L19] CALL __VERIFIER_assert(v <= 1)
[L13] COND FALSE !(!(cond))
[L19] RET __VERIFIER_assert(v <= 1)
[L20] COND FALSE !(v == 0)
End of lasso representation.
- StatisticsResult: NonterminationArgumentStatistics
Fixpoint
- NonterminatingLassoResult [Line: 17]: Nonterminating execution
Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L16] int v = 0;
VAL [v=0]
[L17] COND TRUE __VERIFIER_nondet_bool() == 0
[L18] CALL __VERIFIER_assert(0 <= v)
[L13] COND FALSE !(!(cond))
[L18] RET __VERIFIER_assert(0 <= v)
[L19] CALL __VERIFIER_assert(v <= 1)
[L13] COND FALSE !(!(cond))
[L19] RET __VERIFIER_assert(v <= 1)
[L20] COND TRUE v == 0
[L21] v = 1
VAL [v=1]
Loop:
[L17] COND TRUE __VERIFIER_nondet_bool() == 0
[L18] CALL __VERIFIER_assert(0 <= v)
[L13] COND FALSE !(!(cond))
[L18] RET __VERIFIER_assert(0 <= v)
[L19] CALL __VERIFIER_assert(v <= 1)
[L13] COND FALSE !(!(cond))
[L19] RET __VERIFIER_assert(v <= 1)
[L20] COND FALSE !(v == 0)
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2024-11-08 00:18:50,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(TERM)