./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-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 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:25:30,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:25:30,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:25:30,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:25:30,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:25:30,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:25:30,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:25:30,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:25:30,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:25:30,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:25:30,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:25:30,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:25:30,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:25:30,335 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:25:30,335 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:25:30,336 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:25:30,336 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:25:30,336 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:25:30,336 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:25:30,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:25:30,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:25:30,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:25:30,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:25:30,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:25:30,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:25:30,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:25:30,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:25:30,338 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:25:30,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:25:30,338 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:25:30,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:25:30,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:25:30,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:25:30,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:25:30,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:25:30,340 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:25:30,340 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 -> 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 [2024-11-09 15:25:30,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:25:30,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:25:30,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:25:30,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:25:30,555 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:25:30,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2024-11-09 15:25:31,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:25:31,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:25:31,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2024-11-09 15:25:31,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbad09b64/bf4d0673913f465b84afaedca93312fc/FLAGe1fcca0d3 [2024-11-09 15:25:31,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbad09b64/bf4d0673913f465b84afaedca93312fc [2024-11-09 15:25:31,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:25:31,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:25:31,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:25:31,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:25:31,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:25:31,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:31" (1/1) ... [2024-11-09 15:25:31,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aad6eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:31, skipping insertion in model container [2024-11-09 15:25:31,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:31" (1/1) ... [2024-11-09 15:25:31,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:25:32,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:25:32,240 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:25:32,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:25:32,300 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:25:32,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32 WrapperNode [2024-11-09 15:25:32,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:25:32,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:25:32,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:25:32,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:25:32,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,326 INFO L138 Inliner]: procedures = 109, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-11-09 15:25:32,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:25:32,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:25:32,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:25:32,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:25:32,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,344 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-11-09 15:25:32,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:25:32,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:25:32,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:25:32,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:25:32,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (1/1) ... [2024-11-09 15:25:32,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:32,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:32,383 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-11-09 15:25:32,387 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-11-09 15:25:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:25:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:25:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:25:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:25:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:25:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:25:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:25:32,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:25:32,498 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:25:32,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:25:32,567 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 15:25:32,567 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:25:32,593 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:25:32,594 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:25:32,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:32 BoogieIcfgContainer [2024-11-09 15:25:32,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:25:32,596 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:25:32,596 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:25:32,598 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:25:32,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:32,599 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:25:31" (1/3) ... [2024-11-09 15:25:32,600 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff42d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:25:32, skipping insertion in model container [2024-11-09 15:25:32,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:32,600 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:32" (2/3) ... [2024-11-09 15:25:32,601 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff42d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:25:32, skipping insertion in model container [2024-11-09 15:25:32,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:32,601 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:32" (3/3) ... [2024-11-09 15:25:32,602 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2024-11-09 15:25:32,639 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:25:32,640 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:25:32,640 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:25:32,640 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:25:32,640 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:25:32,640 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:25:32,640 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:25:32,640 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:25:32,643 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-11-09 15:25:32,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:32,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:32,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:32,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:25:32,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:32,659 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:25:32,659 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-11-09 15:25:32,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:32,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:32,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:32,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:25:32,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:32,665 INFO L745 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 4#L552-3true [2024-11-09 15:25:32,665 INFO L747 eck$LassoCheckResult]: Loop: 4#L552-3true goto; 3#main_Loop~3#1true call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 9#L552-1true assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 11#L554true assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int#0(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 4#L552-3true [2024-11-09 15:25:32,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:32,669 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:25:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:32,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395391045] [2024-11-09 15:25:32,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:32,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:32,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:32,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2024-11-09 15:25:32,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:32,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476230263] [2024-11-09 15:25:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:32,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:32,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:32,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2024-11-09 15:25:32,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:32,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452721148] [2024-11-09 15:25:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:32,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:33,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452721148] [2024-11-09 15:25:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452721148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:25:33,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:25:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:25:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124389350] [2024-11-09 15:25:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:25:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:25:33,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:25:33,231 INFO L87 Difference]: Start difference. 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, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:33,248 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-09 15:25:33,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2024-11-09 15:25:33,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:33,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 11 transitions. [2024-11-09 15:25:33,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:33,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:33,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-11-09 15:25:33,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:33,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-09 15:25:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-11-09 15:25:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-09 15:25:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-11-09 15:25:33,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-09 15:25:33,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:25:33,279 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-09 15:25:33,279 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:25:33,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2024-11-09 15:25:33,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:33,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:33,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:33,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:25:33,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:25:33,281 INFO L745 eck$LassoCheckResult]: Stem: 41#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 42#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 40#L552-3 goto; 38#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 39#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 43#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 44#main_Loop~3#1 [2024-11-09 15:25:33,281 INFO L747 eck$LassoCheckResult]: Loop: 44#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 47#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 45#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 44#main_Loop~3#1 [2024-11-09 15:25:33,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2024-11-09 15:25:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:33,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711805246] [2024-11-09 15:25:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:33,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:33,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:33,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2024-11-09 15:25:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:33,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004903696] [2024-11-09 15:25:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:33,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:33,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2024-11-09 15:25:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899119832] [2024-11-09 15:25:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:33,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:33,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:33,686 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:33,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:33,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:33,687 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:33,687 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:33,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:33,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:33,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:33,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2024-11-09 15:25:33,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:33,689 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:33,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,151 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:34,154 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:34,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,157 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-11-09 15:25:34,159 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-11-09 15:25:34,160 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-11-09 15:25:34,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,200 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-11-09 15:25:34,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,203 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-11-09 15:25:34,204 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-11-09 15:25:34,205 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-11-09 15:25:34,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,233 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-11-09 15:25:34,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,235 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-11-09 15:25:34,236 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-11-09 15:25:34,237 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-11-09 15:25:34,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,262 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:34,285 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-09 15:25:34,285 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-09 15:25:34,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,304 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-11-09 15:25:34,306 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-11-09 15:25:34,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:34,322 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:34,322 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:34,323 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 19 Supporting invariants [] [2024-11-09 15:25:34,335 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-11-09 15:25:34,356 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-11-09 15:25:34,362 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 15:25:34,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 15:25:34,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2024-11-09 15:25:34,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:34,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:25:34,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:34,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:25:34,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:34,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2024-11-09 15:25:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:34,484 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-11-09 15:25:34,486 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:34,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 6 states. [2024-11-09 15:25:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-09 15:25:34,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2024-11-09 15:25:34,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:34,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-09 15:25:34,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:34,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2024-11-09 15:25:34,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:34,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-11-09 15:25:34,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:34,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2024-11-09 15:25:34,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:34,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:34,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-11-09 15:25:34,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:34,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-09 15:25:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-11-09 15:25:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-09 15:25:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-09 15:25:34,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-09 15:25:34,531 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-09 15:25:34,531 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:25:34,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-11-09 15:25:34,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:34,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:34,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:34,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-09 15:25:34,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:34,533 INFO L745 eck$LassoCheckResult]: Stem: 160#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 162#L552-3 goto; 169#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 168#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 167#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 166#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 155#L552-1 [2024-11-09 15:25:34,533 INFO L747 eck$LassoCheckResult]: Loop: 155#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 163#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int#0(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 158#L552-3 goto; 154#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 155#L552-1 [2024-11-09 15:25:34,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2024-11-09 15:25:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:34,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556223701] [2024-11-09 15:25:34,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:34,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:34,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:34,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2024-11-09 15:25:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983395897] [2024-11-09 15:25:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:34,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:34,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:34,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2024-11-09 15:25:34,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:34,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207901081] [2024-11-09 15:25:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:34,667 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-11-09 15:25:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:34,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207901081] [2024-11-09 15:25:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207901081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676872584] [2024-11-09 15:25:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:34,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:34,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 15:25:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:34,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:34,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:34,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 15:25:34,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 15:25:34,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 15:25:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:34,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:34,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676872584] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:34,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-09 15:25:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327457189] [2024-11-09 15:25:34,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 15:25:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 15:25:34,963 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:34,998 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-09 15:25:34,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2024-11-09 15:25:34,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:35,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 26 transitions. [2024-11-09 15:25:35,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:35,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:25:35,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2024-11-09 15:25:35,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:35,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-09 15:25:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2024-11-09 15:25:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 15:25:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-09 15:25:35,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-09 15:25:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:25:35,003 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-09 15:25:35,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:25:35,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2024-11-09 15:25:35,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:35,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:35,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:35,004 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2024-11-09 15:25:35,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:35,004 INFO L745 eck$LassoCheckResult]: Stem: 286#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 288#L552-3 goto; 297#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 296#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 292#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 278#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 279#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 291#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 280#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 281#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 301#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 300#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 299#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 298#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 294#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 289#L552-1 [2024-11-09 15:25:35,004 INFO L747 eck$LassoCheckResult]: Loop: 289#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 290#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int#0(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 282#L552-3 goto; 283#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 289#L552-1 [2024-11-09 15:25:35,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 4 times [2024-11-09 15:25:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:35,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574518743] [2024-11-09 15:25:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:35,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2024-11-09 15:25:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:35,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550041629] [2024-11-09 15:25:35,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:35,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:35,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 2 times [2024-11-09 15:25:35,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:35,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850802940] [2024-11-09 15:25:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:35,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850802940] [2024-11-09 15:25:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850802940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:35,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506076096] [2024-11-09 15:25:35,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:25:35,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:35,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:35,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 15:25:35,378 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:25:35,379 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:35,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 15:25:35,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:35,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 15:25:35,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 15:25:35,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:35,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:35,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:35,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 15:25:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:35,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506076096] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:35,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2024-11-09 15:25:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779627024] [2024-11-09 15:25:35,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:35,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:35,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 15:25:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2024-11-09 15:25:35,624 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:35,729 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-09 15:25:35,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 56 transitions. [2024-11-09 15:25:35,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:35,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 44 transitions. [2024-11-09 15:25:35,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:35,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:25:35,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2024-11-09 15:25:35,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:35,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-09 15:25:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2024-11-09 15:25:35,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 15:25:35,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-11-09 15:25:35,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-09 15:25:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 15:25:35,742 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-09 15:25:35,742 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:25:35,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2024-11-09 15:25:35,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:35,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:35,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:35,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2024-11-09 15:25:35,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:35,745 INFO L745 eck$LassoCheckResult]: Stem: 513#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 514#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 515#L552-3 goto; 525#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 524#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 519#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 505#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 506#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 546#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 507#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 508#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 518#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 520#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 545#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 544#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 543#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 542#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 541#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 540#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 539#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 538#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 537#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 536#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 535#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 534#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 533#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 532#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 531#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 530#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 529#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 528#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 527#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 526#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 522#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 516#L552-1 [2024-11-09 15:25:35,745 INFO L747 eck$LassoCheckResult]: Loop: 516#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#1(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 517#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int#0(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 509#L552-3 goto; 510#main_Loop~3#1 call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 516#L552-1 [2024-11-09 15:25:35,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 5 times [2024-11-09 15:25:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:35,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013055954] [2024-11-09 15:25:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:35,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2024-11-09 15:25:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:35,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800151989] [2024-11-09 15:25:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:35,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 3 times [2024-11-09 15:25:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:35,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317745970] [2024-11-09 15:25:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:35,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:41,549 WARN L286 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 202 DAG size of output: 164 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:25:41,653 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:41,654 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:41,654 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:41,654 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:41,654 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:41,654 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,654 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:41,654 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:41,654 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration5_Lasso [2024-11-09 15:25:41,654 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:41,654 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:41,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:41,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:42,082 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:42,082 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:42,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,086 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-11-09 15:25:42,087 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-11-09 15:25:42,088 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-11-09 15:25:42,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:42,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:42,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:42,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,109 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-11-09 15:25:42,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,112 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-11-09 15:25:42,112 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-11-09 15:25:42,113 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-11-09 15:25:42,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:42,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:42,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:42,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:25:42,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,136 INFO L229 MonitoredProcess]: Starting monitored process 10 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-11-09 15:25:42,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:25:42,137 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-11-09 15:25:42,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:42,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:42,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:42,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:25:42,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,159 INFO L229 MonitoredProcess]: Starting monitored process 11 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-11-09 15:25:42,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:25:42,160 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-11-09 15:25:42,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:42,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:42,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:42,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,185 INFO L229 MonitoredProcess]: Starting monitored process 12 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-11-09 15:25:42,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:25:42,187 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-11-09 15:25:42,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:42,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:42,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:42,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:42,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,210 INFO L229 MonitoredProcess]: Starting monitored process 13 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-11-09 15:25:42,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:25:42,212 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-11-09 15:25:42,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:42,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:42,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:42,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:42,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,237 INFO L229 MonitoredProcess]: Starting monitored process 14 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-11-09 15:25:42,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:25:42,238 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-11-09 15:25:42,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:42,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:42,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:42,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,265 INFO L229 MonitoredProcess]: Starting monitored process 15 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-11-09 15:25:42,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:25:42,267 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-11-09 15:25:42,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:42,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:42,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 15:25:42,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,296 INFO L229 MonitoredProcess]: Starting monitored process 16 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-11-09 15:25:42,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:25:42,298 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-11-09 15:25:42,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:42,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:42,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:42,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,328 INFO L229 MonitoredProcess]: Starting monitored process 17 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-11-09 15:25:42,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:25:42,329 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-11-09 15:25:42,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:42,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:42,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:42,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:25:42,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,358 INFO L229 MonitoredProcess]: Starting monitored process 18 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-11-09 15:25:42,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:25:42,359 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-11-09 15:25:42,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:42,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:42,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:42,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:42,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:42,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:42,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:42,390 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:25:42,390 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:25:42,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:42,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:42,392 INFO L229 MonitoredProcess]: Starting monitored process 19 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-11-09 15:25:42,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:25:42,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:42,404 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:25:42,405 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:42,405 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem4#1) = -41*ULTIMATE.start_main_#t~mem4#1 + 790 Supporting invariants [41*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) 0)_2 - 40*ULTIMATE.start_main_#t~mem4#1 >= 0] [2024-11-09 15:25:42,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 15:25:42,454 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2024-11-09 15:25:42,458 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem4 [2024-11-09 15:25:42,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:42,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 15:25:42,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:42,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 15:25:42,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 15:25:42,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:25:42,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:42,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:25:42,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:42,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2024-11-09 15:25:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:42,952 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2024-11-09 15:25:42,952 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:42,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 43 states and 45 transitions. Complement of second has 6 states. [2024-11-09 15:25:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2024-11-09 15:25:42,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-09 15:25:42,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:42,987 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:43,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:43,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 15:25:43,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:43,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 15:25:43,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 15:25:43,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:43,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:25:43,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:43,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2024-11-09 15:25:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:43,497 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2024-11-09 15:25:43,497 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:43,528 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 43 states and 45 transitions. Complement of second has 6 states. [2024-11-09 15:25:43,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2024-11-09 15:25:43,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-09 15:25:43,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:43,529 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:43,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:43,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 15:25:43,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:43,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 15:25:43,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 15:25:43,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:25:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:43,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:25:43,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:43,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2024-11-09 15:25:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:43,994 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2024-11-09 15:25:43,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:44,197 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 59 states and 62 transitions. Complement of second has 45 states. [2024-11-09 15:25:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2024-11-09 15:25:44,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-09 15:25:44,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:44,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 38 letters. Loop has 4 letters. [2024-11-09 15:25:44,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:44,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 34 letters. Loop has 8 letters. [2024-11-09 15:25:44,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:44,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 62 transitions. [2024-11-09 15:25:44,200 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:25:44,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 0 states and 0 transitions. [2024-11-09 15:25:44,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:25:44,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:25:44,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:25:44,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:44,200 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:25:44,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:25:44,200 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:25:44,200 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:25:44,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:25:44,200 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:25:44,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:25:44,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:25:44 BoogieIcfgContainer [2024-11-09 15:25:44,205 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:25:44,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:25:44,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:25:44,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:25:44,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:32" (3/4) ... [2024-11-09 15:25:44,208 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:25:44,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:25:44,209 INFO L158 Benchmark]: Toolchain (without parser) took 12252.04ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 86.6MB in the beginning and 90.8MB in the end (delta: -4.3MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-11-09 15:25:44,209 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 105.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:25:44,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.07ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 68.5MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 15:25:44,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.14ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 66.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:25:44,209 INFO L158 Benchmark]: Boogie Preprocessor took 29.00ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 64.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:25:44,209 INFO L158 Benchmark]: RCFGBuilder took 238.35ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 113.4MB in the end (delta: -48.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-09 15:25:44,213 INFO L158 Benchmark]: BuchiAutomizer took 11609.67ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 113.4MB in the beginning and 90.8MB in the end (delta: 22.6MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2024-11-09 15:25:44,213 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 234.9MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:25:44,214 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.35ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 105.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.07ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 68.5MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.14ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 66.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.00ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 64.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.35ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 113.4MB in the end (delta: -48.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 11609.67ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 113.4MB in the beginning and 90.8MB in the end (delta: 22.6MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 234.9MB. Free memory is still 90.8MB. 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[~i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 15 locations. 3 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.5s and 6 iterations. TraceHistogramMax:11. Analysis of lassos took 9.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 45 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax112 hnf100 lsp89 ukn81 mio100 lsp23 div100 bol100 ite100 ukn100 eq187 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 3 VariablesLoop: 3 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-11-09 15:25:44,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:44,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:44,634 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