./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d 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/loops/nec11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b78564a93d1d434db2fa377a9b33de67cda5b233a427ae8d3550b20661e154a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:26:06,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:26:07,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:26:07,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:26:07,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:26:07,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:26:07,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:26:07,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:26:07,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:26:07,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:26:07,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:26:07,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:26:07,050 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:26:07,051 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:26:07,051 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:26:07,051 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:26:07,051 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:26:07,052 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:26:07,052 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:26:07,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:26:07,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:26:07,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:26:07,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:26:07,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:26:07,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:26:07,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:26:07,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:26:07,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:26:07,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:26:07,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:26:07,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:26:07,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:26:07,062 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:26:07,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:26:07,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:26:07,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:26:07,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:26:07,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:26:07,063 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:26:07,063 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b78564a93d1d434db2fa377a9b33de67cda5b233a427ae8d3550b20661e154a3 [2024-10-13 17:26:07,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:26:07,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:26:07,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:26:07,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:26:07,356 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:26:07,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c [2024-10-13 17:26:08,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:26:08,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:26:08,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c [2024-10-13 17:26:08,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1ada224/ce32273a0d854cbcad2e2d1b52b9d0fd/FLAGd1fb21d19 [2024-10-13 17:26:09,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1ada224/ce32273a0d854cbcad2e2d1b52b9d0fd [2024-10-13 17:26:09,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:26:09,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:26:09,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:26:09,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:26:09,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:26:09,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615f801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09, skipping insertion in model container [2024-10-13 17:26:09,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:26:09,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:26:09,412 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:26:09,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:26:09,432 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:26:09,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09 WrapperNode [2024-10-13 17:26:09,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:26:09,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:26:09,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:26:09,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:26:09,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,455 INFO L138 Inliner]: procedures = 13, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-10-13 17:26:09,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:26:09,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:26:09,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:26:09,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:26:09,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,473 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-13 17:26:09,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:26:09,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:26:09,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:26:09,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:26:09,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (1/1) ... [2024-10-13 17:26:09,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:09,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:09,515 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-13 17:26:09,521 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-13 17:26:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 17:26:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:26:09,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:26:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 17:26:09,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 17:26:09,678 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:26:09,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:26:09,825 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-13 17:26:09,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:26:09,838 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:26:09,840 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 17:26:09,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:26:09 BoogieIcfgContainer [2024-10-13 17:26:09,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:26:09,841 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:26:09,841 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:26:09,845 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:26:09,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:26:09,846 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:26:09" (1/3) ... [2024-10-13 17:26:09,847 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ac84c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:26:09, skipping insertion in model container [2024-10-13 17:26:09,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:26:09,847 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:26:09" (2/3) ... [2024-10-13 17:26:09,848 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ac84c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:26:09, skipping insertion in model container [2024-10-13 17:26:09,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:26:09,848 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:26:09" (3/3) ... [2024-10-13 17:26:09,849 INFO L332 chiAutomizerObserver]: Analyzing ICFG nec11.c [2024-10-13 17:26:09,886 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:26:09,887 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:26:09,887 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:26:09,887 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:26:09,887 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:26:09,887 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:26:09,887 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:26:09,887 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:26:09,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-13 17:26:09,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:26:09,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:26:09,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:26:09,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:26:09,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:26:09,908 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:26:09,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-13 17:26:09,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:26:09,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:26:09,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:26:09,909 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:26:09,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:26:09,915 INFO L745 eck$LassoCheckResult]: Stem: 11#$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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1; 13#L21-2true [2024-10-13 17:26:09,916 INFO L747 eck$LassoCheckResult]: Loop: 13#L21-2true assume !!(0 != main_~c~0#1 % 256); 12#L23true assume !(4 == main_~len~0#1); 9#L23-2true assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13#L21-2true [2024-10-13 17:26:09,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:26:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498897834] [2024-10-13 17:26:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:10,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:10,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:26:10,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 40876, now seen corresponding path program 1 times [2024-10-13 17:26:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:10,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496825736] [2024-10-13 17:26:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:10,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:10,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:10,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:26:10,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 28699818, now seen corresponding path program 1 times [2024-10-13 17:26:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764690111] [2024-10-13 17:26:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:10,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:10,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:26:10,463 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:26:10,463 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:26:10,464 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:26:10,464 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:26:10,464 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:26:10,464 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:10,464 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:26:10,464 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:26:10,464 INFO L132 ssoRankerPreferences]: Filename of dumped script: nec11.c_Iteration1_Lasso [2024-10-13 17:26:10,464 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:26:10,464 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:26:10,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:26:10,948 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:26:10,955 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:26:10,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:10,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:10,963 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-13 17:26:10,965 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-13 17:26:10,966 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-13 17:26:10,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:26:10,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:26:10,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:26:10,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:26:10,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:26:10,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:26:10,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:26:10,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:26:11,006 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-13 17:26:11,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:11,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:11,009 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-13 17:26:11,010 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-13 17:26:11,011 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-13 17:26:11,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:26:11,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:26:11,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:26:11,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:26:11,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:26:11,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:26:11,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:26:11,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:26:11,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-13 17:26:11,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:11,041 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-13 17:26:11,042 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-13 17:26:11,043 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-13 17:26:11,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:26:11,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:26:11,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:26:11,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:26:11,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:26:11,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:26:11,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:26:11,076 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-13 17:26:11,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:11,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:11,079 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-13 17:26:11,080 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-13 17:26:11,082 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-13 17:26:11,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:26:11,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:26:11,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:26:11,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:26:11,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:26:11,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:26:11,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:26:11,109 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-13 17:26:11,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:11,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:11,114 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-13 17:26:11,117 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-13 17:26:11,118 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-13 17:26:11,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:26:11,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:26:11,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:26:11,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:26:11,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:26:11,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:26:11,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:26:11,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:26:11,146 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-13 17:26:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:11,147 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-13 17:26:11,150 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-13 17:26:11,151 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-13 17:26:11,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:26:11,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:26:11,161 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 17:26:11,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:26:11,171 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-13 17:26:11,171 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-13 17:26:11,182 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:26:11,205 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-13 17:26:11,205 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-13 17:26:11,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:26:11,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:11,208 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-13 17:26:11,211 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-13 17:26:11,211 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:26:11,225 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-10-13 17:26:11,226 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:26:11,226 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~len~0#1) = -2*ULTIMATE.start_main_~len~0#1 + 9 Supporting invariants [-1*ULTIMATE.start_main_~len~0#1 + 4 >= 0] [2024-10-13 17:26:11,247 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-13 17:26:11,254 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2024-10-13 17:26:11,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:26:11,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:26:11,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:26:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:26:11,308 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:26:11,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:26:11,330 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-13 17:26:11,351 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:26:11,352 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-13 17:26:11,400 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 39 transitions. Complement of second has 8 states. [2024-10-13 17:26:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:26:11,405 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-13 17:26:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-13 17:26:11,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-13 17:26:11,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:26:11,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-13 17:26:11,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:26:11,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-13 17:26:11,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:26:11,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. [2024-10-13 17:26:11,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:26:11,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 10 states and 13 transitions. [2024-10-13 17:26:11,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-13 17:26:11,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-13 17:26:11,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2024-10-13 17:26:11,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:26:11,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-13 17:26:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2024-10-13 17:26:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-13 17:26:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-13 17:26:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-10-13 17:26:11,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-13 17:26:11,429 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-13 17:26:11,429 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:26:11,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2024-10-13 17:26:11,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:26:11,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:26:11,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:26:11,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:26:11,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:26:11,430 INFO L745 eck$LassoCheckResult]: Stem: 103#$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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 104#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1; 105#L21-2 assume !!(0 != main_~c~0#1 % 256); 101#L23 assume 4 == main_~len~0#1;main_~len~0#1 := 0; 97#L23-2 [2024-10-13 17:26:11,430 INFO L747 eck$LassoCheckResult]: Loop: 97#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 98#L21-2 assume !!(0 != main_~c~0#1 % 256); 106#L23 assume !(4 == main_~len~0#1); 97#L23-2 [2024-10-13 17:26:11,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-10-13 17:26:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:11,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130284842] [2024-10-13 17:26:11,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:26:11,476 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-13 17:26:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:26:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130284842] [2024-10-13 17:26:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130284842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:26:11,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:26:11,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:26:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81437214] [2024-10-13 17:26:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:26:11,484 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:26:11,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash 47446, now seen corresponding path program 2 times [2024-10-13 17:26:11,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:11,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317635632] [2024-10-13 17:26:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:26:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:26:11,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:26:11,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:26:11,535 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:26:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:26:11,545 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-10-13 17:26:11,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-10-13 17:26:11,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:26:11,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2024-10-13 17:26:11,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-13 17:26:11,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-13 17:26:11,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2024-10-13 17:26:11,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:26:11,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-13 17:26:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2024-10-13 17:26:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2024-10-13 17:26:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) 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-13 17:26:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-10-13 17:26:11,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-13 17:26:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:26:11,550 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-13 17:26:11,551 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:26:11,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-10-13 17:26:11,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:26:11,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:26:11,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:26:11,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-10-13 17:26:11,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:26:11,552 INFO L745 eck$LassoCheckResult]: Stem: 131#$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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1; 136#L21-2 assume !!(0 != main_~c~0#1 % 256); 134#L23 assume !(4 == main_~len~0#1); 129#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 130#L21-2 assume !!(0 != main_~c~0#1 % 256); 133#L23 assume 4 == main_~len~0#1;main_~len~0#1 := 0; 127#L23-2 [2024-10-13 17:26:11,553 INFO L747 eck$LassoCheckResult]: Loop: 127#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 128#L21-2 assume !!(0 != main_~c~0#1 % 256); 135#L23 assume !(4 == main_~len~0#1); 127#L23-2 [2024-10-13 17:26:11,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1810721677, now seen corresponding path program 1 times [2024-10-13 17:26:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:11,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039810195] [2024-10-13 17:26:11,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:11,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:26:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:26:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:26:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039810195] [2024-10-13 17:26:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039810195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:26:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505433265] [2024-10-13 17:26:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:26:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:26:11,626 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:26:11,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 17:26:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:26:11,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:26:11,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:26:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:26:11,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:26:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:26:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505433265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:26:11,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:26:11,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-13 17:26:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989272882] [2024-10-13 17:26:11,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:26:11,703 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:26:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 47446, now seen corresponding path program 3 times [2024-10-13 17:26:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044627666] [2024-10-13 17:26:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:26:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:26:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 17:26:11,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 17:26:11,746 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 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-10-13 17:26:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:26:11,764 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-13 17:26:11,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 36 transitions. [2024-10-13 17:26:11,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-13 17:26:11,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 33 transitions. [2024-10-13 17:26:11,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-13 17:26:11,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-13 17:26:11,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2024-10-13 17:26:11,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:26:11,767 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-10-13 17:26:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2024-10-13 17:26:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-13 17:26:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 27 states have internal predecessors, (30), 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-13 17:26:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-13 17:26:11,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-13 17:26:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 17:26:11,770 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-13 17:26:11,771 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:26:11,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2024-10-13 17:26:11,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 17:26:11,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:26:11,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:26:11,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2024-10-13 17:26:11,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2024-10-13 17:26:11,772 INFO L745 eck$LassoCheckResult]: Stem: 223#$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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1; 225#L21-2 assume !!(0 != main_~c~0#1 % 256); 222#L23 assume !(4 == main_~len~0#1); 219#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 220#L21-2 assume !!(0 != main_~c~0#1 % 256); 226#L23 assume !(4 == main_~len~0#1); 244#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 243#L21-2 assume !!(0 != main_~c~0#1 % 256); 242#L23 assume !(4 == main_~len~0#1); 241#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 240#L21-2 assume !!(0 != main_~c~0#1 % 256); 232#L23 assume !(4 == main_~len~0#1); 234#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 231#L21-2 assume !!(0 != main_~c~0#1 % 256); 221#L23 assume 4 == main_~len~0#1;main_~len~0#1 := 0; 217#L23-2 [2024-10-13 17:26:11,772 INFO L747 eck$LassoCheckResult]: Loop: 217#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 218#L21-2 assume !!(0 != main_~c~0#1 % 256); 227#L23 assume !(4 == main_~len~0#1); 228#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 239#L21-2 assume !!(0 != main_~c~0#1 % 256); 238#L23 assume !(4 == main_~len~0#1); 237#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 236#L21-2 assume !!(0 != main_~c~0#1 % 256); 235#L23 assume !(4 == main_~len~0#1); 230#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 233#L21-2 assume !!(0 != main_~c~0#1 % 256); 229#L23 assume 4 == main_~len~0#1;main_~len~0#1 := 0; 217#L23-2 [2024-10-13 17:26:11,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 658202022, now seen corresponding path program 2 times [2024-10-13 17:26:11,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:11,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110274615] [2024-10-13 17:26:11,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:26:11,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1957011391, now seen corresponding path program 1 times [2024-10-13 17:26:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413895176] [2024-10-13 17:26:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:26:11,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:26:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash -282022428, now seen corresponding path program 3 times [2024-10-13 17:26:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:26:11,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837949677] [2024-10-13 17:26:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:26:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:26:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:11,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:26:12,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-13 17:26:12,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2024-10-13 17:26:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:12,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:26:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:26:12,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:26:12 BoogieIcfgContainer [2024-10-13 17:26:12,309 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:26:12,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:26:12,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:26:12,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:26:12,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:26:09" (3/4) ... [2024-10-13 17:26:12,311 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 17:26:12,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 17:26:12,351 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:26:12,351 INFO L158 Benchmark]: Toolchain (without parser) took 3112.85ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 114.7MB in the beginning and 192.2MB in the end (delta: -77.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-13 17:26:12,354 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:26:12,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.78ms. Allocated memory is still 184.5MB. Free memory was 114.5MB in the beginning and 102.7MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 17:26:12,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.70ms. Allocated memory is still 184.5MB. Free memory was 102.6MB in the beginning and 101.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:26:12,354 INFO L158 Benchmark]: Boogie Preprocessor took 23.26ms. Allocated memory is still 184.5MB. Free memory was 101.2MB in the beginning and 99.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:26:12,355 INFO L158 Benchmark]: RCFGBuilder took 361.65ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 150.7MB in the end (delta: -51.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-10-13 17:26:12,355 INFO L158 Benchmark]: BuchiAutomizer took 2467.49ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 150.7MB in the beginning and 194.3MB in the end (delta: -43.6MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-10-13 17:26:12,355 INFO L158 Benchmark]: Witness Printer took 41.44ms. Allocated memory is still 274.7MB. Free memory was 194.3MB in the beginning and 192.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:26:12,356 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.16ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.78ms. Allocated memory is still 184.5MB. Free memory was 114.5MB in the beginning and 102.7MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.70ms. Allocated memory is still 184.5MB. Free memory was 102.6MB in the beginning and 101.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.26ms. Allocated memory is still 184.5MB. Free memory was 101.2MB in the beginning and 99.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.65ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 150.7MB in the end (delta: -51.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2467.49ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 150.7MB in the beginning and 194.3MB in the end (delta: -43.6MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * Witness Printer took 41.44ms. Allocated memory is still 274.7MB. Free memory was 194.3MB in the beginning and 192.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (9 + ((long long) -2 * len)) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:5. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 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, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 12 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf100 lsp39 ukn44 mio100 lsp69 div305 bol100 ite100 ukn100 eq154 hnf96 smp56 dnf165 smp100 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 79ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: 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: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L15] int a[5]; [L16] int len=0; [L17] _Bool c=__VERIFIER_nondet_bool(); [L18] int i; VAL [c=1, len=0] [L21] COND TRUE \read(c) VAL [c=1, len=0] [L23] COND FALSE !(len==4) VAL [c=1, len=0] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=1] [L21] COND TRUE \read(c) VAL [c=1, len=1] [L23] COND FALSE !(len==4) VAL [c=1, len=1] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=2] [L21] COND TRUE \read(c) VAL [c=1, len=2] [L23] COND FALSE !(len==4) VAL [c=1, len=2] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=3] [L21] COND TRUE \read(c) VAL [c=1, len=3] [L23] COND FALSE !(len==4) VAL [c=1, len=3] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=4] [L21] COND TRUE \read(c) VAL [c=1, len=4] [L23] COND TRUE len==4 [L24] len =0 VAL [c=1, len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int a[5]; [L16] int len=0; [L17] _Bool c=__VERIFIER_nondet_bool(); [L18] int i; VAL [c=1, len=0] [L21] COND TRUE \read(c) VAL [c=1, len=0] [L23] COND FALSE !(len==4) VAL [c=1, len=0] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=1] [L21] COND TRUE \read(c) VAL [c=1, len=1] [L23] COND FALSE !(len==4) VAL [c=1, len=1] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=2] [L21] COND TRUE \read(c) VAL [c=1, len=2] [L23] COND FALSE !(len==4) VAL [c=1, len=2] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=3] [L21] COND TRUE \read(c) VAL [c=1, len=3] [L23] COND FALSE !(len==4) VAL [c=1, len=3] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=4] [L21] COND TRUE \read(c) VAL [c=1, len=4] [L23] COND TRUE len==4 [L24] len =0 VAL [c=1, len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-13 17:26:12,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 17:26:12,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)