/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs FAIRNESS_LAZY -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 12:09:54,463 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 12:09:54,542 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 12:09:54,571 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 12:09:54,572 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 12:09:54,572 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 12:09:54,577 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 12:09:54,578 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 12:09:54,578 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 12:09:54,584 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 12:09:54,584 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 12:09:54,584 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 12:09:54,585 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 12:09:54,586 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 12:09:54,586 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 12:09:54,587 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 12:09:54,587 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 12:09:54,587 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 12:09:54,587 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 12:09:54,587 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 12:09:54,588 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 12:09:54,588 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 12:09:54,588 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 12:09:54,588 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 12:09:54,589 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 12:09:54,589 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 12:09:54,589 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 12:09:54,589 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 12:09:54,590 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 12:09:54,590 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 12:09:54,591 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 12:09:54,591 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 12:09:54,591 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 12:09:54,591 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 12:09:54,593 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 12:09:54,593 INFO L137 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.buchiautomizer: Fairness type for concurrent programs -> FAIRNESS_LAZY [2023-09-17 12:09:54,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 12:09:54,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 12:09:54,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 12:09:54,879 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 12:09:54,879 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 12:09:54,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2023-09-17 12:09:56,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 12:09:56,322 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 12:09:56,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2023-09-17 12:09:56,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b65bffa/6b864c52a6ee4b3eb4b8e0184d20d384/FLAGdaf259a4a [2023-09-17 12:09:56,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b65bffa/6b864c52a6ee4b3eb4b8e0184d20d384 [2023-09-17 12:09:56,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 12:09:56,348 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 12:09:56,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 12:09:56,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 12:09:56,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 12:09:56,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b59a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56, skipping insertion in model container [2023-09-17 12:09:56,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 12:09:56,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 12:09:56,542 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2454,2467] [2023-09-17 12:09:56,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:09:56,556 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 12:09:56,576 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2454,2467] [2023-09-17 12:09:56,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:09:56,591 INFO L208 MainTranslator]: Completed translation [2023-09-17 12:09:56,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56 WrapperNode [2023-09-17 12:09:56,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 12:09:56,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 12:09:56,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 12:09:56,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 12:09:56,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,637 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 139 [2023-09-17 12:09:56,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 12:09:56,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 12:09:56,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 12:09:56,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 12:09:56,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 12:09:56,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 12:09:56,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 12:09:56,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 12:09:56,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (1/1) ... [2023-09-17 12:09:56,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:56,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:56,713 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) [2023-09-17 12:09:56,717 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 [2023-09-17 12:09:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 12:09:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 12:09:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 12:09:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 12:09:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 12:09:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 12:09:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 12:09:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 12:09:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-17 12:09:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 12:09:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 12:09:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-17 12:09:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 12:09:56,750 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 12:09:56,843 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 12:09:56,845 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 12:09:57,080 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 12:09:57,088 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 12:09:57,088 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-17 12:09:57,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:09:57 BoogieIcfgContainer [2023-09-17 12:09:57,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 12:09:57,092 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 12:09:57,092 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 12:09:57,095 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 12:09:57,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:57,096 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 12:09:56" (1/3) ... [2023-09-17 12:09:57,097 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36abf6d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:09:57, skipping insertion in model container [2023-09-17 12:09:57,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:57,097 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:56" (2/3) ... [2023-09-17 12:09:57,097 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36abf6d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:09:57, skipping insertion in model container [2023-09-17 12:09:57,098 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:57,098 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:09:57" (3/3) ... [2023-09-17 12:09:57,099 INFO L332 chiAutomizerObserver]: Analyzing ICFG unroll-3.wvr.c [2023-09-17 12:09:57,218 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 12:09:57,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 162 transitions, 334 flow [2023-09-17 12:09:57,302 INFO L124 PetriNetUnfolderBase]: 15/158 cut-off events. [2023-09-17 12:09:57,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 12:09:57,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 158 events. 15/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-09-17 12:09:57,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 162 transitions, 334 flow [2023-09-17 12:09:57,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 158 transitions, 322 flow [2023-09-17 12:09:57,343 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 12:09:57,344 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 12:09:57,344 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 12:09:57,344 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 12:09:57,344 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 12:09:57,344 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 12:09:57,344 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 12:09:57,345 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 12:09:57,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:10:12,347 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1500 [2023-09-17 12:10:12,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:10:12,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:10:12,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:10:12,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:10:12,359 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 12:10:12,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:10:20,034 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1500 [2023-09-17 12:10:20,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:10:20,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:10:20,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:10:20,036 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:10:20,042 INFO L748 eck$LassoCheckResult]: Stem: SleepPredicate [underlying: 155#[$Ultimate##0]don't care, sleep set: []] [247] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] SleepPredicate [underlying: 158#[L-1]don't care, sleep set: []] [258] L-1-->L-1-1: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 160#[L-1-1]don't care, sleep set: []] [369] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 162#[L21]don't care, sleep set: []] [330] L21-->L21-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 164#[L21-1]don't care, sleep set: []] [359] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 166#[L21-2]don't care, sleep set: []] [264] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 168#[L21-3]don't care, sleep set: []] [311] L21-3-->L21-4: Formula: (and (= (select |v_#valid_16| 2) 1) (= (select |v_#length_11| 2) 15)) InVars {#length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 170#[L21-4]don't care, sleep set: []] [290] L21-4-->L42: Formula: (and (= v_~f~0.base_6 0) (= v_~f~0.offset_6 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_6, ~f~0.offset=v_~f~0.offset_6} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] SleepPredicate [underlying: 172#[L42]don't care, sleep set: []] [279] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] SleepPredicate [underlying: 174#[L42-1]don't care, sleep set: []] [361] L42-1-->L42-2: Formula: (= v_~x2~0_11 0) InVars {} OutVars{~x2~0=v_~x2~0_11} AuxVars[] AssignedVars[~x2~0] SleepPredicate [underlying: 176#[L42-2]don't care, sleep set: []] [287] L42-2-->L43: Formula: (= 0 v_~size~0_6) InVars {} OutVars{~size~0=v_~size~0_6} AuxVars[] AssignedVars[~size~0] SleepPredicate [underlying: 178#[L43]don't care, sleep set: []] [364] L43-->L-1-2: Formula: (= v_~n~0_6 0) InVars {} OutVars{~n~0=v_~n~0_6} AuxVars[] AssignedVars[~n~0] SleepPredicate [underlying: 180#[L-1-2]don't care, sleep set: []] [372] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 182#[L-1-3]don't care, sleep set: []] [378] L-1-3-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_4|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 184#[L74]don't care, sleep set: []] [299] L74-->L74-1: Formula: (and (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_#valid_17| (store |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_12|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] SleepPredicate [underlying: 186#[L74-1]don't care, sleep set: []] [332] L74-1-->L74-2: Formula: (and (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_14|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 188#[L74-2]don't care, sleep set: []] [341] L74-2-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] SleepPredicate [underlying: 190#[L77]don't care, sleep set: []] [306] L77-->L77-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~n~0_7) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{~n~0=v_~n~0_7, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[~n~0] SleepPredicate [underlying: 192#[L77-1]don't care, sleep set: []] [316] L77-1-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] SleepPredicate [underlying: 194#[L78]don't care, sleep set: []] [238] L78-->L78-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] SleepPredicate [underlying: 196#[L78-1]don't care, sleep set: []] [320] L78-1-->L78-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~size~0_7) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~size~0=v_~size~0_7, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~size~0] SleepPredicate [underlying: 198#[L78-2]don't care, sleep set: []] [260] L78-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] SleepPredicate [underlying: 200#[L79]don't care, sleep set: []] [273] L79-->L79-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~size~0_8) 1 0)) InVars {~size~0=v_~size~0_8} OutVars{~size~0=v_~size~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 202#[L79-1]don't care, sleep set: []] [355] L79-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 204#[L37]don't care, sleep set: []] [281] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 206#[L38]don't care, sleep set: []] [292] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 210#[L37-1]don't care, sleep set: []] [282] L37-1-->L80: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~size~0_5) InVars {~size~0=v_~size~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] SleepPredicate [underlying: 212#[L80]don't care, sleep set: []] [232] L80-->L80-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] SleepPredicate [underlying: 214#[L80-1]don't care, sleep set: []] [356] L80-1-->L94: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] SleepPredicate [underlying: 216#[L94]don't care, sleep set: []] [362] L94-->L95: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] SleepPredicate [underlying: 218#[L95]don't care, sleep set: []] [317] L95-->L95-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 220#[L95-1]don't care, sleep set: []] [334] L95-1-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 222#[L37-2]don't care, sleep set: []] [236] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 224#[L38-3]don't care, sleep set: []] [253] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 228#[L37-3]don't care, sleep set: []] [248] L37-3-->L96: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 230#[L96]don't care, sleep set: []] [349] L96-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 232#[L37-4]don't care, sleep set: []] [347] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 234#[L38-6]don't care, sleep set: []] [327] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 238#[L37-5]don't care, sleep set: []] [307] L37-5-->L98: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 240#[L98]don't care, sleep set: []] [336] L98-->L98-1: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] SleepPredicate [underlying: 242#[L98-1]don't care, sleep set: []] [234] L98-1-->L98-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] SleepPredicate [underlying: 244#[L98-2]don't care, sleep set: []] [308] L98-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] SleepPredicate [underlying: 246#[L99]don't care, sleep set: []] [343] L99-->L99-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] SleepPredicate [underlying: 248#[L99-6]don't care, sleep set: []] [2023-09-17 12:10:20,043 INFO L750 eck$LassoCheckResult]: Loop: SleepPredicate [underlying: 248#[L99-6]don't care, sleep set: []] [255] L99-6-->L100: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 252#[L100]don't care, sleep set: []] [278] L100-->L100-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] SleepPredicate [underlying: 256#[L100-1]don't care, sleep set: []] [301] L100-1-->L100-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|)) |v_#memory_int_5|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_6|, #length=|v_#length_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_5|, #length=|v_#length_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] SleepPredicate [underlying: 260#[L100-2]don't care, sleep set: []] [335] L100-2-->L99-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] SleepPredicate [underlying: 264#[L99-3]don't care, sleep set: []] [318] L99-3-->L99-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] SleepPredicate [underlying: 268#[L99-4]don't care, sleep set: []] [357] L99-4-->L99-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] SleepPredicate [underlying: 272#[L99-5]don't care, sleep set: []] [324] L99-5-->L99-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] SleepPredicate [underlying: 248#[L99-6]don't care, sleep set: []] [2023-09-17 12:10:20,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:10:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 177889986, now seen corresponding path program 1 times [2023-09-17 12:10:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:10:20,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130193276] [2023-09-17 12:10:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:10:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:10:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:20,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:10:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:20,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:10:20,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:10:20,284 INFO L85 PathProgramCache]: Analyzing trace with hash 80228483, now seen corresponding path program 1 times [2023-09-17 12:10:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:10:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892088837] [2023-09-17 12:10:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:10:20,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:10:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:20,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:10:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:20,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:10:20,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:10:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1021207202, now seen corresponding path program 1 times [2023-09-17 12:10:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:10:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176176540] [2023-09-17 12:10:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:10:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:10:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:20,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:10:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:20,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:10:21,459 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 12:10:21,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 12:10:21,461 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 12:10:21,461 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 12:10:21,461 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 12:10:21,462 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:10:21,462 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 12:10:21,462 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 12:10:21,463 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-3.wvr.c_BEv2_Iteration1_Lasso [2023-09-17 12:10:21,463 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 12:10:21,463 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 12:10:21,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:21,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:22,618 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 12:10:22,622 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 12:10:22,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:10:22,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:10:22,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 12:10:22,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-09-17 12:10:22,641 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 [2023-09-17 12:10:22,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:10:22,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 12:10:22,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:10:22,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:10:22,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:10:22,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 12:10:22,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 12:10:22,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:10:22,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-09-17 12:10:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:10:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:10:22,681 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) [2023-09-17 12:10:22,684 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 [2023-09-17 12:10:22,712 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 [2023-09-17 12:10:22,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:10:22,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:10:22,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:10:22,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:10:22,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:10:22,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:10:22,765 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 12:10:22,826 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2023-09-17 12:10:22,826 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-09-17 12:10:22,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:10:22,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:10:22,924 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) [2023-09-17 12:10:22,926 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 [2023-09-17 12:10:22,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 12:10:22,947 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-09-17 12:10:22,947 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 12:10:22,948 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ~size~0) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*~size~0 Supporting invariants [1*~size~0 - 1*ULTIMATE.start_create_fresh_int_array_~size#1 >= 0] [2023-09-17 12:10:22,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-09-17 12:10:23,030 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2023-09-17 12:10:23,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:10:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:10:23,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-17 12:10:23,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:10:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:10:23,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-17 12:10:23,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:10:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 12:10:23,359 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2023-09-17 12:10:23,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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) [2023-09-17 12:10:23,777 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 [2023-09-17 12:10:38,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 137079 states and 440428 transitions. Complement of second has 11 states. [2023-09-17 12:10:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-17 12:10:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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) [2023-09-17 12:10:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 284 transitions. [2023-09-17 12:10:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 284 transitions. Stem has 43 letters. Loop has 7 letters. [2023-09-17 12:10:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:10:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 284 transitions. Stem has 50 letters. Loop has 7 letters. [2023-09-17 12:10:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:10:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 284 transitions. Stem has 43 letters. Loop has 14 letters. [2023-09-17 12:10:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:10:38,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137079 states and 440428 transitions. [2023-09-17 12:10:40,960 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:10:40,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137079 states to 0 states and 0 transitions. [2023-09-17 12:10:40,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 12:10:40,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 12:10:40,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 12:10:40,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 12:10:40,963 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:10:40,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:10:40,963 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:10:40,963 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 12:10:40,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 12:10:40,964 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:10:40,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 12:10:40,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 12:10:40 BoogieIcfgContainer [2023-09-17 12:10:40,971 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 12:10:40,971 INFO L158 Benchmark]: Toolchain (without parser) took 44623.08ms. Allocated memory was 185.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 136.1MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 800.4MB. Max. memory is 8.0GB. [2023-09-17 12:10:40,972 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 12:10:40,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.87ms. Allocated memory is still 185.6MB. Free memory was 135.8MB in the beginning and 124.5MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 12:10:40,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.21ms. Allocated memory is still 185.6MB. Free memory was 124.5MB in the beginning and 122.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 12:10:40,973 INFO L158 Benchmark]: Boogie Preprocessor took 37.54ms. Allocated memory is still 185.6MB. Free memory was 122.5MB in the beginning and 120.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 12:10:40,974 INFO L158 Benchmark]: RCFGBuilder took 413.59ms. Allocated memory is still 185.6MB. Free memory was 120.8MB in the beginning and 104.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-09-17 12:10:40,974 INFO L158 Benchmark]: BuchiAutomizer took 43879.05ms. Allocated memory was 185.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 103.9MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 768.9MB. Max. memory is 8.0GB. [2023-09-17 12:10:40,976 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.14ms. Allocated memory is still 185.6MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.87ms. Allocated memory is still 185.6MB. Free memory was 135.8MB in the beginning and 124.5MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.21ms. Allocated memory is still 185.6MB. Free memory was 124.5MB in the beginning and 122.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.54ms. Allocated memory is still 185.6MB. Free memory was 122.5MB in the beginning and 120.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 413.59ms. Allocated memory is still 185.6MB. Free memory was 120.8MB in the beginning and 104.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 43879.05ms. Allocated memory was 185.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 103.9MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 768.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 15.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 2.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 123 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax115 hnf100 lsp73 ukn73 mio100 lsp40 div242 bol100 ite100 ukn100 eq147 hnf94 smp60 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 268ms VariablesStem: 10 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-17 12:10:41,006 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...