./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.05-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.05-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5dfaa1e7d8e11d61c3d4d0b8b3724f22fd323b68a720b01bc26596e3781d27f8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 23:53:24,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 23:53:25,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-24 23:53:25,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 23:53:25,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 23:53:25,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 23:53:25,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 23:53:25,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 23:53:25,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 23:53:25,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 23:53:25,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 23:53:25,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 23:53:25,126 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 23:53:25,127 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-24 23:53:25,128 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-24 23:53:25,128 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-24 23:53:25,129 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-24 23:53:25,129 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-24 23:53:25,129 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-24 23:53:25,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 23:53:25,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-24 23:53:25,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 23:53:25,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 23:53:25,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-24 23:53:25,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-24 23:53:25,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-24 23:53:25,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 23:53:25,132 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 23:53:25,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 23:53:25,133 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-24 23:53:25,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 23:53:25,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 23:53:25,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 23:53:25,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 23:53:25,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 23:53:25,135 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-24 23:53:25,135 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5dfaa1e7d8e11d61c3d4d0b8b3724f22fd323b68a720b01bc26596e3781d27f8 [2024-10-24 23:53:25,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 23:53:25,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 23:53:25,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 23:53:25,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 23:53:25,409 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 23:53:25,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.05-alloca.i [2024-10-24 23:53:26,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 23:53:27,090 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 23:53:27,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.05-alloca.i [2024-10-24 23:53:27,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6706ec094/06c0bfa1cbac441ea971e2d1644b682f/FLAG4cef4e13f [2024-10-24 23:53:27,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6706ec094/06c0bfa1cbac441ea971e2d1644b682f [2024-10-24 23:53:27,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 23:53:27,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 23:53:27,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 23:53:27,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 23:53:27,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 23:53:27,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdfa2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27, skipping insertion in model container [2024-10-24 23:53:27,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 23:53:27,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 23:53:27,469 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 23:53:27,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 23:53:27,553 INFO L204 MainTranslator]: Completed translation [2024-10-24 23:53:27,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27 WrapperNode [2024-10-24 23:53:27,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 23:53:27,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 23:53:27,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 23:53:27,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 23:53:27,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,598 INFO L138 Inliner]: procedures = 111, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-10-24 23:53:27,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 23:53:27,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 23:53:27,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 23:53:27,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 23:53:27,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,630 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 4 writes are split as follows [1, 2, 1]. [2024-10-24 23:53:27,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 23:53:27,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 23:53:27,642 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 23:53:27,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 23:53:27,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (1/1) ... [2024-10-24 23:53:27,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:27,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:27,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:27,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-24 23:53:27,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 23:53:27,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 23:53:27,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 23:53:27,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 23:53:27,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 23:53:27,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 23:53:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 23:53:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 23:53:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 23:53:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 23:53:27,870 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 23:53:27,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 23:53:28,001 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-24 23:53:28,002 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 23:53:28,013 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 23:53:28,013 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 23:53:28,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:28 BoogieIcfgContainer [2024-10-24 23:53:28,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 23:53:28,016 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-24 23:53:28,016 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-24 23:53:28,020 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-24 23:53:28,021 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:53:28,021 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 24.10 11:53:27" (1/3) ... [2024-10-24 23:53:28,022 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1676c948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.10 11:53:28, skipping insertion in model container [2024-10-24 23:53:28,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:53:28,022 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:27" (2/3) ... [2024-10-24 23:53:28,023 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1676c948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.10 11:53:28, skipping insertion in model container [2024-10-24 23:53:28,024 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:53:28,024 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:28" (3/3) ... [2024-10-24 23:53:28,026 INFO L332 chiAutomizerObserver]: Analyzing ICFG a.05-alloca.i [2024-10-24 23:53:28,094 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-24 23:53:28,094 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-24 23:53:28,094 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-24 23:53:28,095 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-24 23:53:28,095 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-24 23:53:28,095 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-24 23:53:28,095 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-24 23:53:28,096 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-24 23:53:28,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:53:28,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:53:28,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:53:28,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:53:28,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-24 23:53:28,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:53:28,132 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-24 23:53:28,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:53:28,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:53:28,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:53:28,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:53:28,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-24 23:53:28,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:53:28,142 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 8#L555-5true [2024-10-24 23:53:28,142 INFO L747 eck$LassoCheckResult]: Loop: 8#L555-5true call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 < 2147483647; 10#L555-1true assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 >= 1 + test_fun_#t~mem6#1; 3#L555-3true assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem9#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 8#L555-5true [2024-10-24 23:53:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:53:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-24 23:53:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:53:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903848166] [2024-10-24 23:53:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:53:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:53:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:53:28,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:53:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:53:28,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:53:28,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:53:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 36846, now seen corresponding path program 1 times [2024-10-24 23:53:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:53:28,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294444990] [2024-10-24 23:53:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:53:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:53:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:53:28,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:53:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:53:28,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:53:28,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:53:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2024-10-24 23:53:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:53:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310255337] [2024-10-24 23:53:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:53:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:53:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:53:28,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:53:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:53:28,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:53:29,275 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:53:29,276 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:53:29,276 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:53:29,276 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:53:29,276 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:53:29,277 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:29,277 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:53:29,277 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:53:29,277 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.05-alloca.i_Iteration1_Lasso [2024-10-24 23:53:29,277 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:53:29,278 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:53:29,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:29,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:53:30,105 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:53:30,109 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:53:30,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:30,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:30,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:30,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-24 23:53:30,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:53:30,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:53:30,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:53:30,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:53:30,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:53:30,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:53:30,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:53:30,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:53:30,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:53:30,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-24 23:53:30,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:30,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:30,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-24 23:53:30,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:53:30,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:53:30,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:53:30,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:53:30,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:53:30,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:53:30,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:53:30,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:53:30,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:53:30,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-24 23:53:30,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:30,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:30,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:30,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-24 23:53:30,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:53:30,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:53:30,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:53:30,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:53:30,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:53:30,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:53:30,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:53:30,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:53:30,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-24 23:53:30,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:30,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:30,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:30,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-24 23:53:30,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:53:30,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:53:30,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:53:30,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:53:30,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:53:30,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:53:30,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:53:30,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:53:30,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-24 23:53:30,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:30,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:30,294 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:30,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-24 23:53:30,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:53:30,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:53:30,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:53:30,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:53:30,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:53:30,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:53:30,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:53:30,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:53:30,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-24 23:53:30,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:30,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:30,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:30,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-24 23:53:30,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:53:30,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:53:30,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:53:30,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:53:30,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:53:30,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:53:30,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:53:30,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:53:30,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-24 23:53:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:30,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:30,395 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:30,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-24 23:53:30,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:53:30,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:53:30,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:53:30,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:53:30,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:53:30,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:53:30,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:53:30,426 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:53:30,458 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-24 23:53:30,458 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-24 23:53:30,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:53:30,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:53:30,553 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:53:30,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-24 23:53:30,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:53:30,566 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:53:30,566 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:53:30,567 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1, v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = -4294967294*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1 + 4294967293*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 Supporting invariants [] [2024-10-24 23:53:30,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-24 23:53:30,665 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2024-10-24 23:53:30,675 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-24 23:53:30,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-24 23:53:30,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-10-24 23:53:30,677 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-24 23:53:30,677 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-24 23:53:30,677 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-10-24 23:53:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:53:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:53:30,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 23:53:30,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:53:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:53:30,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 23:53:30,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:53:30,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-24 23:53:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:53:31,014 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-24 23:53:31,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-10-24 23:53:31,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) Result 29 states and 36 transitions. Complement of second has 10 states. [2024-10-24 23:53:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-24 23:53:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-10-24 23:53:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2024-10-24 23:53:31,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-24 23:53:31,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:53:31,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-24 23:53:31,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:53:31,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-24 23:53:31,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:53:31,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2024-10-24 23:53:31,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:53:31,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 15 transitions. [2024-10-24 23:53:31,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-24 23:53:31,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-24 23:53:31,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-10-24 23:53:31,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:53:31,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-24 23:53:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-10-24 23:53:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-24 23:53:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-10-24 23:53:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-10-24 23:53:31,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-24 23:53:31,164 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-24 23:53:31,164 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-24 23:53:31,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-10-24 23:53:31,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:53:31,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:53:31,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:53:31,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-24 23:53:31,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:53:31,165 INFO L745 eck$LassoCheckResult]: Stem: 178#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 183#L555-5 call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 < 2147483647; 180#L555-1 [2024-10-24 23:53:31,165 INFO L747 eck$LassoCheckResult]: Loop: 180#L555-1 assume !test_fun_#t~short8#1; 174#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem9#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 175#L555-5 call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 < 2147483647; 180#L555-1 [2024-10-24 23:53:31,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:53:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-10-24 23:53:31,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:53:31,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879811270] [2024-10-24 23:53:31,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:53:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:53:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:53:31,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:53:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:53:31,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:53:31,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:53:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash 41888, now seen corresponding path program 1 times [2024-10-24 23:53:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:53:31,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462512464] [2024-10-24 23:53:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:53:31,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:53:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:53:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:53:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:53:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462512464] [2024-10-24 23:53:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462512464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:53:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:53:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 23:53:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044062723] [2024-10-24 23:53:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:53:31,302 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-24 23:53:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:53:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 23:53:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 23:53:31,308 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-10-24 23:53:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:53:31,326 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2024-10-24 23:53:31,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-10-24 23:53:31,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-24 23:53:31,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2024-10-24 23:53:31,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-24 23:53:31,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-24 23:53:31,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-24 23:53:31,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-24 23:53:31,328 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:53:31,329 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:53:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 23:53:31,330 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:53:31,330 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-24 23:53:31,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-24 23:53:31,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-24 23:53:31,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-24 23:53:31,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 24.10 11:53:31 BoogieIcfgContainer [2024-10-24 23:53:31,340 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-24 23:53:31,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 23:53:31,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 23:53:31,341 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 23:53:31,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:28" (3/4) ... [2024-10-24 23:53:31,344 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 23:53:31,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 23:53:31,347 INFO L158 Benchmark]: Toolchain (without parser) took 4209.13ms. Allocated memory is still 188.7MB. Free memory was 121.7MB in the beginning and 122.6MB in the end (delta: -908.3kB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-10-24 23:53:31,347 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:53:31,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.13ms. Allocated memory is still 188.7MB. Free memory was 121.5MB in the beginning and 103.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 23:53:31,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.05ms. Allocated memory is still 188.7MB. Free memory was 103.5MB in the beginning and 101.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 23:53:31,349 INFO L158 Benchmark]: Boogie Preprocessor took 41.99ms. Allocated memory is still 188.7MB. Free memory was 101.8MB in the beginning and 99.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 23:53:31,349 INFO L158 Benchmark]: RCFGBuilder took 372.89ms. Allocated memory is still 188.7MB. Free memory was 99.6MB in the beginning and 147.6MB in the end (delta: -47.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 23:53:31,350 INFO L158 Benchmark]: BuchiAutomizer took 3324.16ms. Allocated memory is still 188.7MB. Free memory was 147.6MB in the beginning and 122.6MB in the end (delta: 24.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-10-24 23:53:31,351 INFO L158 Benchmark]: Witness Printer took 5.14ms. Allocated memory is still 188.7MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:53:31,353 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.45ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.13ms. Allocated memory is still 188.7MB. Free memory was 121.5MB in the beginning and 103.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.05ms. Allocated memory is still 188.7MB. Free memory was 103.5MB in the beginning and 101.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.99ms. Allocated memory is still 188.7MB. Free memory was 101.8MB in the beginning and 99.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.89ms. Allocated memory is still 188.7MB. Free memory was 99.6MB in the beginning and 147.6MB in the end (delta: -47.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 3324.16ms. Allocated memory is still 188.7MB. Free memory was 147.6MB in the beginning and 122.6MB in the end (delta: 24.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 5.14ms. Allocated memory is still 188.7MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 10 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital213 mio100 ax108 hnf100 lsp92 ukn68 mio100 lsp26 div100 bol100 ite100 ukn100 eq163 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-24 23:53:31,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 Result: TRUE