./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:58:54,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:58:54,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-12 20:58:54,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:58:54,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:58:54,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:58:54,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:58:54,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:58:54,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:58:54,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:58:54,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:58:54,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:58:54,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:58:54,554 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 20:58:54,554 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 20:58:54,554 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 20:58:54,555 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 20:58:54,555 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 20:58:54,555 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 20:58:54,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:58:54,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 20:58:54,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:58:54,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:58:54,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 20:58:54,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 20:58:54,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 20:58:54,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:58:54,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:58:54,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:58:54,557 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 20:58:54,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:58:54,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:58:54,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:58:54,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:58:54,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:58:54,559 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 20:58:54,559 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-12 20:58:54,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:58:54,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:58:54,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:58:54,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:58:54,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:58:54,767 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-12 20:58:56,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:58:56,263 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:58:56,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2024-11-12 20:58:56,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd189279b/1afa054fd9f243a082e9d5b7b4503b83/FLAG23035831b [2024-11-12 20:58:56,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd189279b/1afa054fd9f243a082e9d5b7b4503b83 [2024-11-12 20:58:56,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:58:56,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:58:56,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:58:56,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:58:56,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:58:56,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:58:56" (1/1) ... [2024-11-12 20:58:56,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110df6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:56, skipping insertion in model container [2024-11-12 20:58:56,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:58:56" (1/1) ... [2024-11-12 20:58:56,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:58:56,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:58:56,968 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:58:57,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:58:57,022 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:58:57,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57 WrapperNode [2024-11-12 20:58:57,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:58:57,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:58:57,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:58:57,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:58:57,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,061 INFO L138 Inliner]: procedures = 109, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-11-12 20:58:57,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:58:57,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:58:57,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:58:57,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:58:57,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,084 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-12 20:58:57,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:58:57,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:58:57,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:58:57,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:58:57,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:57,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:57,125 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-12 20:58:57,128 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-12 20:58:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:58:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:58:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:58:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:58:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:58:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:58:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:58:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:58:57,252 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:58:57,254 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:58:57,330 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-12 20:58:57,330 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:58:57,338 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:58:57,338 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 20:58:57,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:58:57 BoogieIcfgContainer [2024-11-12 20:58:57,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:58:57,339 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 20:58:57,339 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 20:58:57,342 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 20:58:57,343 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:57,343 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 08:58:56" (1/3) ... [2024-11-12 20:58:57,346 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fbc454c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:58:57, skipping insertion in model container [2024-11-12 20:58:57,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:57,346 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (2/3) ... [2024-11-12 20:58:57,346 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fbc454c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:58:57, skipping insertion in model container [2024-11-12 20:58:57,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:57,346 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:58:57" (3/3) ... [2024-11-12 20:58:57,347 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2024-11-12 20:58:57,385 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 20:58:57,385 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 20:58:57,385 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 20:58:57,386 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 20:58:57,386 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 20:58:57,386 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 20:58:57,386 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 20:58:57,386 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 20:58:57,389 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-12 20:58:57,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:58:57,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:57,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:57,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:58:57,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:58:57,410 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 20:58:57,410 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-12 20:58:57,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:58:57,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:57,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:57,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:58:57,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:58:57,418 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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);" [2024-11-12 20:58:57,418 INFO L749 eck$LassoCheckResult]: Loop: "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "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;" [2024-11-12 20:58:57,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 20:58:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553097213] [2024-11-12 20:58:57,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,542 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2024-11-12 20:58:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:57,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295638075] [2024-11-12 20:58:57,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:57,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,606 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:57,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2024-11-12 20:58:57,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:57,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911956937] [2024-11-12 20:58:57,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:58:57,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911956937] [2024-11-12 20:58:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911956937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:58:57,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568630440] [2024-11-12 20:58:57,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:57,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:57,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:57,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:58:57,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:58:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:58,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:58:58,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:58,063 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-12 20:58:58,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:58:58,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568630440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:58:58,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:58:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-12 20:58:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531535436] [2024-11-12 20:58:58,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:58:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:58:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:58:58,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:58:58,304 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 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-12 20:58:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:58:58,335 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-12 20:58:58,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2024-11-12 20:58:58,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:58:58,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 14 transitions. [2024-11-12 20:58:58,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-12 20:58:58,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-12 20:58:58,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-11-12 20:58:58,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:58:58,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-12 20:58:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-11-12 20:58:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-12 20:58:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:58:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-12 20:58:58,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-12 20:58:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:58:58,364 INFO L426 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-12 20:58:58,365 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 20:58:58,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2024-11-12 20:58:58,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:58:58,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:58,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:58,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] [2024-11-12 20:58:58,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:58:58,366 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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);" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" [2024-11-12 20:58:58,366 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" [2024-11-12 20:58:58,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 1 times [2024-11-12 20:58:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:58,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261123772] [2024-11-12 20:58:58,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:58,379 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:58,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:58,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2024-11-12 20:58:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399137986] [2024-11-12 20:58:58,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:58,400 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:58,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:58,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash -460217657, now seen corresponding path program 2 times [2024-11-12 20:58:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581864446] [2024-11-12 20:58:58,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:58,420 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:58,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:58,806 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:58:58,807 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:58:58,807 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:58:58,807 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:58:58,807 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:58:58,808 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:58,808 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:58:58,808 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:58:58,810 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2024-11-12 20:58:58,811 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:58:58,811 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:58:58,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:59,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:59,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:59,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:59,194 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:58:59,197 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:58:59,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:59,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,218 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-12 20:58:59,220 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-12 20:58:59,221 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-12 20:58:59,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:58:59,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:58:59,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:58:59,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:58:59,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:58:59,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:58:59,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:58:59,263 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-12 20:58:59,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:59,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,265 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-12 20:58:59,267 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-12 20:58:59,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-12 20:58:59,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:58:59,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:58:59,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:58:59,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:58:59,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:58:59,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:58:59,288 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:58:59,305 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-12 20:58:59,306 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-12 20:58:59,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:59,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,310 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-12 20:58:59,314 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-12 20:58:59,315 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:58:59,327 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 20:58:59,327 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:58:59,327 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-12 20:58:59,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-12 20:58:59,352 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-12 20:58:59,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 20:58:59,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-12 20:58:59,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2024-11-12 20:58:59,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:58:59,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:58:59,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:59,428 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-12 20:58:59,439 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-12 20:58:59,442 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-12 20:58:59,443 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12 20:58:59,475 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 21 states and 23 transitions. Complement of second has 6 states. [2024-11-12 20:58:59,476 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-12 20:58:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12 20:58:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-12 20:58:59,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-12 20:58:59,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:58:59,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-12 20:58:59,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:58:59,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-12 20:58:59,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:58:59,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2024-11-12 20:58:59,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:58:59,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 21 transitions. [2024-11-12 20:58:59,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-12 20:58:59,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-12 20:58:59,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2024-11-12 20:58:59,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:58:59,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-12 20:58:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2024-11-12 20:58:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-12 20:58:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 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-12 20:58:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-12 20:58:59,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-12 20:58:59,482 INFO L426 stractBuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-12 20:58:59,482 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 20:58:59,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2024-11-12 20:58:59,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:58:59,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:59,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:59,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2024-11-12 20:58:59,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:58:59,484 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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);" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:58:59,484 INFO L749 eck$LassoCheckResult]: Loop: "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);" "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;" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:58:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 3 times [2024-11-12 20:58:59,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:59,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270465966] [2024-11-12 20:58:59,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:59,503 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:59,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2024-11-12 20:58:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:59,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289975086] [2024-11-12 20:58:59,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:59,517 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:59,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:59,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 1 times [2024-11-12 20:58:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:59,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464117423] [2024-11-12 20:58:59,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,751 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-12 20:58:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:58:59,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464117423] [2024-11-12 20:58:59,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464117423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:58:59,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2983575] [2024-11-12 20:58:59,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:59,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,772 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-12 20:58:59,774 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-12 20:58:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 20:58:59,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:59,844 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-12 20:58:59,858 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-12 20:58:59,871 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-12 20:58:59,899 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-12 20:58:59,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:58:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2983575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:58:59,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:58:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-11-12 20:58:59,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387398013] [2024-11-12 20:58:59,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:00,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:00,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:59:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:59:00,034 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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-12 20:59:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:00,096 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-12 20:59:00,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2024-11-12 20:59:00,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:00,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 30 states and 32 transitions. [2024-11-12 20:59:00,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-12 20:59:00,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 20:59:00,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2024-11-12 20:59:00,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:00,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-12 20:59:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2024-11-12 20:59:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-12 20:59:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 29 states have internal predecessors, (32), 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-12 20:59:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-12 20:59:00,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-12 20:59:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 20:59:00,102 INFO L426 stractBuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-12 20:59:00,102 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 20:59:00,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2024-11-12 20:59:00,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:00,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:00,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:00,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2024-11-12 20:59:00,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:59:00,103 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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);" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:00,104 INFO L749 eck$LassoCheckResult]: Loop: "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);" "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;" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:00,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 4 times [2024-11-12 20:59:00,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670387291] [2024-11-12 20:59:00,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,122 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2024-11-12 20:59:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795056320] [2024-11-12 20:59:00,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,139 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 2 times [2024-11-12 20:59:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526801423] [2024-11-12 20:59:00,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:00,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:00,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526801423] [2024-11-12 20:59:00,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526801423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:00,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647912864] [2024-11-12 20:59:00,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:59:00,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:00,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:00,621 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-12 20:59:00,625 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-12 20:59:00,673 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:59:00,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:59:00,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-12 20:59:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896018238] [2024-11-12 20:59:00,674 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:00,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 20:59:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:59:00,752 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-12 20:59:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:00,828 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-11-12 20:59:00,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2024-11-12 20:59:00,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:00,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2024-11-12 20:59:00,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-12 20:59:00,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 20:59:00,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2024-11-12 20:59:00,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:00,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-12 20:59:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2024-11-12 20:59:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 20:59:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 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-12 20:59:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-12 20:59:00,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-12 20:59:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 20:59:00,833 INFO L426 stractBuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-12 20:59:00,833 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 20:59:00,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2024-11-12 20:59:00,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:00,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:00,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:00,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2024-11-12 20:59:00,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:59:00,834 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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);" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:00,834 INFO L749 eck$LassoCheckResult]: Loop: "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);" "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;" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:00,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 5 times [2024-11-12 20:59:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356239629] [2024-11-12 20:59:00,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,848 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2024-11-12 20:59:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668383276] [2024-11-12 20:59:00,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,863 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 3 times [2024-11-12 20:59:00,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513030712] [2024-11-12 20:59:00,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:01,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513030712] [2024-11-12 20:59:01,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513030712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:01,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334582124] [2024-11-12 20:59:01,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 20:59:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:01,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:01,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 20:59:01,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:59:01,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:59:01,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-12 20:59:01,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295766497] [2024-11-12 20:59:01,420 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 20:59:01,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:59:01,497 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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-12 20:59:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:01,596 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-12 20:59:01,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2024-11-12 20:59:01,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:01,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2024-11-12 20:59:01,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-12 20:59:01,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 20:59:01,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2024-11-12 20:59:01,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:01,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-12 20:59:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2024-11-12 20:59:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 20:59:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 35 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-12 20:59:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-12 20:59:01,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-12 20:59:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 20:59:01,603 INFO L426 stractBuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-12 20:59:01,603 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 20:59:01,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2024-11-12 20:59:01,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:01,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:01,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:01,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2024-11-12 20:59:01,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:59:01,605 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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);" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:01,605 INFO L749 eck$LassoCheckResult]: Loop: "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);" "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;" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:01,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 6 times [2024-11-12 20:59:01,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:01,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726026821] [2024-11-12 20:59:01,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:01,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,621 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:01,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2024-11-12 20:59:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:01,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731983221] [2024-11-12 20:59:01,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:01,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,636 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 4 times [2024-11-12 20:59:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019553079] [2024-11-12 20:59:01,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:02,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019553079] [2024-11-12 20:59:02,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019553079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252053642] [2024-11-12 20:59:02,088 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 20:59:02,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:02,090 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:02,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 20:59:02,141 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:59:02,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:59:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-12 20:59:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010986141] [2024-11-12 20:59:02,142 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 20:59:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:59:02,207 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-12 20:59:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:02,299 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-11-12 20:59:02,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2024-11-12 20:59:02,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:02,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2024-11-12 20:59:02,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-12 20:59:02,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 20:59:02,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2024-11-12 20:59:02,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:02,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-12 20:59:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2024-11-12 20:59:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-12 20:59:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 38 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-12 20:59:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-12 20:59:02,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-12 20:59:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 20:59:02,307 INFO L426 stractBuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-12 20:59:02,308 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 20:59:02,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2024-11-12 20:59:02,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:02,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:02,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:02,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2024-11-12 20:59:02,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:59:02,312 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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);" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:02,312 INFO L749 eck$LassoCheckResult]: Loop: "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);" "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;" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:02,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 7 times [2024-11-12 20:59:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212221797] [2024-11-12 20:59:02,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:02,335 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:02,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:02,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:02,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2024-11-12 20:59:02,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781085294] [2024-11-12 20:59:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:02,356 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:02,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:02,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:02,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 5 times [2024-11-12 20:59:02,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:02,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766847027] [2024-11-12 20:59:02,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:02,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766847027] [2024-11-12 20:59:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766847027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:02,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036883959] [2024-11-12 20:59:02,869 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 20:59:02,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:02,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:02,872 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:02,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 20:59:02,927 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:59:02,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:59:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-12 20:59:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496402504] [2024-11-12 20:59:02,927 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:02,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:02,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 20:59:02,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-11-12 20:59:02,996 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 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-12 20:59:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:03,106 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2024-11-12 20:59:03,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2024-11-12 20:59:03,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:03,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2024-11-12 20:59:03,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-12 20:59:03,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 20:59:03,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2024-11-12 20:59:03,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:03,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-12 20:59:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2024-11-12 20:59:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-12 20:59:03,108 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-12 20:59:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-11-12 20:59:03,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-12 20:59:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 20:59:03,110 INFO L426 stractBuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-12 20:59:03,110 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 20:59:03,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2024-11-12 20:59:03,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:59:03,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:03,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:03,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2024-11-12 20:59:03,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:59:03,112 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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);" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" "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);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:03,112 INFO L749 eck$LassoCheckResult]: Loop: "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);" "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;" "goto;" "call main_#t~mem4#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2024-11-12 20:59:03,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 8 times [2024-11-12 20:59:03,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956902348] [2024-11-12 20:59:03,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,126 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:03,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2024-11-12 20:59:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389694700] [2024-11-12 20:59:03,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,143 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:03,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 6 times [2024-11-12 20:59:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410003318] [2024-11-12 20:59:03,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,172 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:09,584 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 202 DAG size of output: 167 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-12 20:59:09,717 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:59:09,717 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:59:09,717 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:59:09,717 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:59:09,717 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:59:09,718 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:09,718 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:59:09,718 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:59:09,718 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration8_Lasso [2024-11-12 20:59:09,718 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:59:09,718 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:59:09,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:09,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:10,098 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:59:10,098 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:59:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,100 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-12 20:59:10,101 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-12 20:59:10,102 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-12 20:59:10,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:10,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:10,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:10,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-12 20:59:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,128 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-12 20:59:10,129 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-12 20:59:10,129 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-12 20:59:10,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:10,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:10,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:10,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,151 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-12 20:59:10,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,153 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-12 20:59:10,153 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-12 20:59:10,154 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-12 20:59:10,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:10,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:10,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:10,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-12 20:59:10,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,177 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-12 20:59:10,179 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-12 20:59:10,179 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-12 20:59:10,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:10,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:10,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,210 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-12 20:59:10,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,213 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-12 20:59:10,214 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-12 20:59:10,214 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-12 20:59:10,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:10,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:10,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,243 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-12 20:59:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,245 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-12 20:59:10,247 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-12 20:59:10,253 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-12 20:59:10,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:10,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:10,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:10,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,275 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-12 20:59:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,276 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-12 20:59:10,277 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-12 20:59:10,277 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-12 20:59:10,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:10,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:10,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:10,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,300 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-12 20:59:10,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,301 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-12 20:59:10,302 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-12 20:59:10,303 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-12 20:59:10,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:10,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:10,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,327 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-12 20:59:10,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,329 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-12 20:59:10,330 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-12 20:59:10,331 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-12 20:59:10,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:10,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:10,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:10,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,357 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-12 20:59:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,361 INFO L229 MonitoredProcess]: Starting monitored process 20 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-12 20:59:10,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-12 20:59:10,367 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-12 20:59:10,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:10,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:10,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:10,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:10,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,396 INFO L229 MonitoredProcess]: Starting monitored process 21 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-12 20:59:10,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-12 20:59:10,397 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-12 20:59:10,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:10,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:10,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-12 20:59:10,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,429 INFO L229 MonitoredProcess]: Starting monitored process 22 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-12 20:59:10,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-12 20:59:10,432 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-12 20:59:10,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:10,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:10,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:10,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,465 INFO L229 MonitoredProcess]: Starting monitored process 23 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-12 20:59:10,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-12 20:59:10,468 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-12 20:59:10,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:10,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:10,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:10,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:10,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,496 INFO L229 MonitoredProcess]: Starting monitored process 24 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-12 20:59:10,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-12 20:59:10,498 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-12 20:59:10,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:10,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:10,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:10,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:10,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:10,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:10,518 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:59:10,539 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-12 20:59:10,539 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-12 20:59:10,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:10,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:10,541 INFO L229 MonitoredProcess]: Starting monitored process 25 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-12 20:59:10,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-12 20:59:10,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:59:10,555 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-12 20:59:10,555 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:59:10,555 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) 0)_1) = -11*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) 0)_1 + 224 Supporting invariants [-22*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) 0)_1 + 23*ULTIMATE.start_main_#t~mem4#1 >= 0] [2024-11-12 20:59:10,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:10,602 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2024-11-12 20:59:10,606 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 20:59:10,606 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-12 20:59:10,606 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2024-11-12 20:59:10,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:10,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 20:59:10,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:10,680 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-12 20:59:10,717 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-12 20:59:10,750 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-12 20:59:10,781 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-12 20:59:10,811 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-12 20:59:10,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-12 20:59:10,878 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-12 20:59:10,911 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-12 20:59:10,948 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-12 20:59:10,992 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-12 20:59:11,032 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-12 20:59:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:11,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 20:59:11,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:11,101 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 47 treesize of output 20 [2024-11-12 20:59:11,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:11,153 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-12 20:59:11,154 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-12 20:59:11,154 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-12 20:59:11,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 42 states and 44 transitions. Complement of second has 5 states. [2024-11-12 20:59:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2024-11-12 20:59:11,199 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-12 20:59:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2024-11-12 20:59:11,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-12 20:59:11,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:11,200 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:59:11,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:11,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 20:59:11,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:11,261 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-12 20:59:11,285 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-12 20:59:11,311 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-12 20:59:11,337 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-12 20:59:11,374 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-12 20:59:11,409 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-12 20:59:11,439 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-12 20:59:11,473 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-12 20:59:11,504 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-12 20:59:11,537 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-12 20:59:11,577 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-12 20:59:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:11,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 20:59:11,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:11,621 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 47 treesize of output 20 [2024-11-12 20:59:11,673 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-12 20:59:11,674 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-12 20:59:11,674 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-12 20:59:11,708 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-12 20:59:11,708 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-12 20:59:11,709 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-12 20:59:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2024-11-12 20:59:11,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-12 20:59:11,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:11,709 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:59:11,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:11,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 20:59:11,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:11,769 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-12 20:59:11,797 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-12 20:59:11,833 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-12 20:59:11,865 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-12 20:59:11,900 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-12 20:59:11,934 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-12 20:59:11,969 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-12 20:59:12,004 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-12 20:59:12,040 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-12 20:59:12,080 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-12 20:59:12,126 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-12 20:59:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:12,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 20:59:12,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:12,179 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 47 treesize of output 20 [2024-11-12 20:59:12,236 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-12 20:59:12,237 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-12 20:59:12,237 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-12 20:59:12,480 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 42 states and 44 transitions. Complement of second has 33 states. [2024-11-12 20:59:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 12 stem states 0 non-accepting loop states 2 accepting loop states [2024-11-12 20:59:12,482 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-12 20:59:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2024-11-12 20:59:12,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-12 20:59:12,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:12,483 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:59:12,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:12,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 20:59:12,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:12,542 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-12 20:59:12,574 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-12 20:59:12,602 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-12 20:59:12,629 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-12 20:59:12,668 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-12 20:59:12,700 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-12 20:59:12,733 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-12 20:59:12,772 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-12 20:59:12,807 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-12 20:59:12,845 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-12 20:59:12,883 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-12 20:59:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:12,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 20:59:12,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:12,922 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 47 treesize of output 20 [2024-11-12 20:59:12,980 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-12 20:59:12,981 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2024-11-12 20:59:12,981 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-12 20:59:13,184 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-12 20:59:13,184 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-12 20:59:13,185 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-12 20:59:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2024-11-12 20:59:13,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-12 20:59:13,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:13,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 38 letters. Loop has 4 letters. [2024-11-12 20:59:13,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:13,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 34 letters. Loop has 8 letters. [2024-11-12 20:59:13,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:13,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 62 transitions. [2024-11-12 20:59:13,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 20:59:13,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 0 states and 0 transitions. [2024-11-12 20:59:13,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-12 20:59:13,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-12 20:59:13,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-12 20:59:13,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:59:13,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:59:13,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:59:13,187 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:59:13,189 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 20:59:13,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-12 20:59:13,189 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 20:59:13,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-12 20:59:13,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 08:59:13 BoogieIcfgContainer [2024-11-12 20:59:13,195 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 20:59:13,195 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 20:59:13,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 20:59:13,196 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 20:59:13,196 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:58:57" (3/4) ... [2024-11-12 20:59:13,198 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 20:59:13,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 20:59:13,199 INFO L158 Benchmark]: Toolchain (without parser) took 16555.46ms. Allocated memory was 178.3MB in the beginning and 331.4MB in the end (delta: 153.1MB). Free memory was 108.8MB in the beginning and 187.4MB in the end (delta: -78.6MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,199 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 109.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:59:13,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.55ms. Allocated memory is still 178.3MB. Free memory was 108.6MB in the beginning and 145.9MB in the end (delta: -37.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.23ms. Allocated memory is still 178.3MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,200 INFO L158 Benchmark]: Boogie Preprocessor took 33.15ms. Allocated memory is still 178.3MB. Free memory was 143.8MB in the beginning and 141.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,200 INFO L158 Benchmark]: RCFGBuilder took 241.65ms. Allocated memory is still 178.3MB. Free memory was 141.7MB in the beginning and 130.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,200 INFO L158 Benchmark]: BuchiAutomizer took 15855.65ms. Allocated memory was 178.3MB in the beginning and 331.4MB in the end (delta: 153.1MB). Free memory was 130.6MB in the beginning and 187.4MB in the end (delta: -56.8MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,200 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 331.4MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:59:13,201 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.39ms. Allocated memory is still 109.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.55ms. Allocated memory is still 178.3MB. Free memory was 108.6MB in the beginning and 145.9MB in the end (delta: -37.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.23ms. Allocated memory is still 178.3MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.15ms. Allocated memory is still 178.3MB. Free memory was 143.8MB in the beginning and 141.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 241.65ms. Allocated memory is still 178.3MB. Free memory was 141.7MB in the beginning and 130.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 15855.65ms. Allocated memory was 178.3MB in the beginning and 331.4MB in the end (delta: 153.1MB). Free memory was 130.6MB in the beginning and 187.4MB in the end (delta: -56.8MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 331.4MB. Free memory is still 187.4MB. 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: #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,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (6 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. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 9 iterations. TraceHistogramMax:11. Analysis of lassos took 12.4s. Construction of modules took 0.3s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 75 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc6 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital155 mio100 ax111 hnf100 lsp88 ukn69 mio100 lsp25 div100 bol100 ite100 ukn100 eq180 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-12 20:59:13,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 20:59:13,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 20:59:13,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 20:59:13,823 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-12 20:59:14,024 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-12 20:59:14,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:14,424 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