/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_INTERSECTION -i ../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-08 14:39:38,255 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-08 14:39:38,321 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-08 14:39:38,346 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 14:39:38,347 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 14:39:38,348 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 14:39:38,348 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 14:39:38,349 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 14:39:38,349 INFO L137 SettingsManager]: * Use SBE=true [2023-09-08 14:39:38,352 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-08 14:39:38,353 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-08 14:39:38,353 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-08 14:39:38,353 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-08 14:39:38,354 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-08 14:39:38,354 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-08 14:39:38,355 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 14:39:38,355 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-08 14:39:38,355 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-08 14:39:38,355 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 14:39:38,355 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-08 14:39:38,355 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 14:39:38,357 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-08 14:39:38,357 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-08 14:39:38,357 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-08 14:39:38,357 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-08 14:39:38,357 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 14:39:38,357 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-08 14:39:38,357 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-08 14:39:38,358 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-08 14:39:38,358 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 14:39:38,359 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 14:39:38,359 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 14:39:38,359 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 14:39:38,359 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 14:39:38,360 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-08 14:39:38,360 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_INTERSECTION [2023-09-08 14:39:38,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 14:39:38,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 14:39:38,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 14:39:38,617 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 14:39:38,618 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 14:39:38,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2023-09-08 14:39:39,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 14:39:40,051 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 14:39:40,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2023-09-08 14:39:40,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b32db3b/2e3b3c91a5854826911d6a8b21ea2144/FLAG4785274b7 [2023-09-08 14:39:40,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b32db3b/2e3b3c91a5854826911d6a8b21ea2144 [2023-09-08 14:39:40,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 14:39:40,081 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 14:39:40,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 14:39:40,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 14:39:40,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 14:39:40,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac11f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40, skipping insertion in model container [2023-09-08 14:39:40,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-08 14:39:40,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-08 14:39:40,266 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/chl-array-int-symm.wvr.c[2482,2495] [2023-09-08 14:39:40,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:39:40,288 INFO L203 MainTranslator]: Completed pre-run [2023-09-08 14:39:40,318 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/chl-array-int-symm.wvr.c[2482,2495] [2023-09-08 14:39:40,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:39:40,339 INFO L208 MainTranslator]: Completed translation [2023-09-08 14:39:40,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40 WrapperNode [2023-09-08 14:39:40,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 14:39:40,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 14:39:40,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 14:39:40,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 14:39:40,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,393 INFO L138 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 196 [2023-09-08 14:39:40,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 14:39:40,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 14:39:40,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 14:39:40,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 14:39:40,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 14:39:40,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 14:39:40,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 14:39:40,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 14:39:40,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (1/1) ... [2023-09-08 14:39:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:40,464 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-08 14:39:40,467 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-08 14:39:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 14:39:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 14:39:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 14:39:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 14:39:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 14:39:40,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 14:39:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 14:39:40,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 14:39:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 14:39:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-08 14:39:40,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 14:39:40,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 14:39:40,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 14:39:40,492 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 14:39:40,574 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 14:39:40,575 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 14:39:40,882 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 14:39:40,889 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 14:39:40,890 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-08 14:39:40,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:39:40 BoogieIcfgContainer [2023-09-08 14:39:40,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 14:39:40,892 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-08 14:39:40,892 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-08 14:39:40,895 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-08 14:39:40,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:39:40,895 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.09 02:39:40" (1/3) ... [2023-09-08 14:39:40,896 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2117c7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:39:40, skipping insertion in model container [2023-09-08 14:39:40,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:39:40,896 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:39:40" (2/3) ... [2023-09-08 14:39:40,901 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2117c7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:39:40, skipping insertion in model container [2023-09-08 14:39:40,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:39:40,901 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:39:40" (3/3) ... [2023-09-08 14:39:40,902 INFO L332 chiAutomizerObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2023-09-08 14:39:41,034 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 14:39:41,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 225 transitions, 466 flow [2023-09-08 14:39:41,127 INFO L124 PetriNetUnfolderBase]: 21/221 cut-off events. [2023-09-08 14:39:41,127 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-09-08 14:39:41,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 221 events. 21/221 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 294 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 145. Up to 3 conditions per place. [2023-09-08 14:39:41,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 225 transitions, 466 flow [2023-09-08 14:39:41,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 221 transitions, 454 flow [2023-09-08 14:39:41,160 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-08 14:39:41,161 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-08 14:39:41,161 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-08 14:39:41,161 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-08 14:39:41,161 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-08 14:39:41,161 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-08 14:39:41,161 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-08 14:39:41,161 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-08 14:39:41,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-08 14:39:43,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-09-08 14:39:43,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:39:43,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:39:43,945 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] [2023-09-08 14:39:43,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:39:43,946 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-08 14:39:43,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-08 14:39:45,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-09-08 14:39:45,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:39:45,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:39:45,228 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] [2023-09-08 14:39:45,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:39:45,234 INFO L748 eck$LassoCheckResult]: Stem: 219#[$Ultimate##0]don't care [445] $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] 224#[L-1]don't care [451] L-1-->L-1-1: Formula: (= (select |v_#valid_17| 0) 0) InVars {#valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|} AuxVars[] AssignedVars[] 228#[L-1-1]don't care [524] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 231#[L21]don't care [397] L21-->L21-1: Formula: (and (= 1 (select |v_#valid_18| 1)) (= 2 (select |v_#length_13| 1))) InVars {#length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_13|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 234#[L21-1]don't care [516] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_15| 1) 0) 48) InVars {#memory_int=|v_#memory_int_15|} OutVars{#memory_int=|v_#memory_int_15|} AuxVars[] AssignedVars[] 237#[L21-2]don't care [456] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_16| 1) 1) 0) InVars {#memory_int=|v_#memory_int_16|} OutVars{#memory_int=|v_#memory_int_16|} AuxVars[] AssignedVars[] 240#[L21-3]don't care [488] L21-3-->L21-4: Formula: (and (= (select |v_#valid_19| 2) 1) (= (select |v_#length_14| 2) 25)) InVars {#length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#length=|v_#length_14|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[] 243#[L21-4]don't care [372] L21-4-->L41: Formula: (and (= v_~a1~0.base_5 0) (= v_~a1~0.offset_5 0)) InVars {} OutVars{~a1~0.offset=v_~a1~0.offset_5, ~a1~0.base=v_~a1~0.base_5} AuxVars[] AssignedVars[~a1~0.offset, ~a1~0.base] 246#[L41]don't care [333] L41-->L42: Formula: (and (= v_~a2~0.offset_5 0) (= v_~a2~0.base_5 0)) InVars {} OutVars{~a2~0.offset=v_~a2~0.offset_5, ~a2~0.base=v_~a2~0.base_5} AuxVars[] AssignedVars[~a2~0.base, ~a2~0.offset] 249#[L42]don't care [364] L42-->L42-1: Formula: (= v_~res1~0_6 0) InVars {} OutVars{~res1~0=v_~res1~0_6} AuxVars[] AssignedVars[~res1~0] 252#[L42-1]don't care [517] L42-1-->L42-2: Formula: (= v_~res2~0_6 0) InVars {} OutVars{~res2~0=v_~res2~0_6} AuxVars[] AssignedVars[~res2~0] 255#[L42-2]don't care [472] L42-2-->L42-3: Formula: (= v_~n1~0_7 0) InVars {} OutVars{~n1~0=v_~n1~0_7} AuxVars[] AssignedVars[~n1~0] 258#[L42-3]don't care [441] L42-3-->L-1-2: Formula: (= v_~n2~0_7 0) InVars {} OutVars{~n2~0=v_~n2~0_7} AuxVars[] AssignedVars[~n2~0] 261#[L-1-2]don't care [528] 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] 264#[L-1-3]don't care [531] L-1-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_1|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_4|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_1|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_1|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 267#[L76]don't care [373] L76-->L76-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#valid_21| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_20|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_15|) (= (select |v_#valid_21| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_16|, #valid=|v_#valid_21|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 270#[L76-1]don't care [515] L76-1-->L76-2: Formula: (and (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_18|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 273#[L76-2]don't care [520] L76-2-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 276#[L78]don't care [328] L78-->L78-1: Formula: (= v_~n1~0_8 |v_ULTIMATE.start_main_#t~nondet13#1_3|) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ~n1~0=v_~n1~0_8} AuxVars[] AssignedVars[~n1~0] 279#[L78-1]don't care [390] L78-1-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 282#[L79]don't care [358] L79-->L79-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 285#[L79-1]don't care [513] L79-1-->L79-2: Formula: (= v_~n2~0_8 |v_ULTIMATE.start_main_#t~nondet14#1_3|) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} OutVars{~n2~0=v_~n2~0_8, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[~n2~0] 288#[L79-2]don't care [447] L79-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 291#[L80]don't care [434] L80-->L80-1: Formula: (= v_~n1~0_9 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~n1~0=v_~n1~0_9} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n1~0=v_~n1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 294#[L80-1]don't care [514] L80-1-->L80-2: 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] 297#[L80-2]don't care [326] L80-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_1|, 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~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_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_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#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_#t~malloc23#1.offset, 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~malloc23#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_create_fresh_int_array_~size#1] 300#[L97]don't care [483] L97-->L98: 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] 303#[L98]don't care [497] L98-->L98-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (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_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 306#[L98-1]don't care [435] L98-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 309#[L37]don't care [366] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 312#[L38]don't care [474] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 318#[L37-1]don't care [464] L37-1-->L99: 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_9|) 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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 321#[L99]don't care [402] L99-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 324#[L37-2]don't care [438] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_18| |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_18|, 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] 327#[L38-3]don't care [344] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_20| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[] 333#[L37-3]don't care [335] L37-3-->L101: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 336#[L101]don't care [519] L101-->L101-1: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_2|) (= (select |v_#valid_25| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_19|) (= |v_#valid_24| (store |v_#valid_25| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2|, #valid=|v_#valid_24|, #length=|v_#length_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #valid, #length] 339#[L101-1]don't care [439] L101-1-->L101-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_3|, 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 342#[L101-2]don't care [383] L101-2-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base] 345#[L102]don't care [350] L102-->L102-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] 348#[L102-6]don't care [2023-09-08 14:39:45,238 INFO L750 eck$LassoCheckResult]: Loop: 348#[L102-6]don't care [330] L102-6-->L103: 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[] 353#[L103]don't care [518] L103-->L103-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet25#1] 357#[L103-1]don't care [349] L103-1-->L103-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse1) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_3|))) (= (select |v_#valid_26| |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|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_18|, #length=|v_#length_21|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_3|} 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|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_3|} AuxVars[] AssignedVars[#memory_int] 363#[L103-2]don't care [494] L103-2-->L102-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet25#1] 369#[L102-3]don't care [367] L102-3-->L102-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post24#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~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#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~post24#1] 375#[L102-4]don't care [347] L102-4-->L102-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#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] 381#[L102-5]don't care [411] L102-5-->L102-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post24#1] 348#[L102-6]don't care [2023-09-08 14:39:45,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:39:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1527500385, now seen corresponding path program 1 times [2023-09-08 14:39:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:39:45,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403850245] [2023-09-08 14:39:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:39:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:39:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:45,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:39:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:45,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:39:45,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:39:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash 548669409, now seen corresponding path program 1 times [2023-09-08 14:39:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:39:45,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933704398] [2023-09-08 14:39:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:39:45,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:39:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:45,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:39:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:45,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:39:45,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:39:45,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2044022145, now seen corresponding path program 1 times [2023-09-08 14:39:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:39:45,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866379445] [2023-09-08 14:39:45,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:39:45,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:39:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:45,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:39:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:45,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:39:46,583 INFO L210 LassoAnalysis]: Preferences: [2023-09-08 14:39:46,584 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-08 14:39:46,584 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-08 14:39:46,584 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-08 14:39:46,584 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-08 14:39:46,584 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:46,584 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-08 14:39:46,585 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-08 14:39:46,585 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-array-int-symm.wvr.c_BEv2_Iteration1_Lasso [2023-09-08 14:39:46,585 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-08 14:39:46,585 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-08 14:39:46,602 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-08 14:39:46,608 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-08 14:39:46,611 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-08 14:39:46,613 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-08 14:39:46,614 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-08 14:39:46,616 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-08 14:39:46,619 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-08 14:39:46,621 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-08 14:39:46,623 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-08 14:39:46,625 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-08 14:39:46,627 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-08 14:39:46,629 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-08 14:39:46,631 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-08 14:39:46,633 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-08 14:39:46,941 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-08 14:39:46,944 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-08 14:39:46,946 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-08 14:39:46,949 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-08 14:39:46,951 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-08 14:39:46,953 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-08 14:39:46,956 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-08 14:39:46,959 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-08 14:39:46,961 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-08 14:39:46,963 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-08 14:39:46,966 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-08 14:39:46,968 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-08 14:39:46,970 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-08 14:39:46,973 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-08 14:39:46,975 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-08 14:39:46,977 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-08 14:39:46,979 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-08 14:39:46,981 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-08 14:39:46,983 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-08 14:39:46,985 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-08 14:39:46,987 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-08 14:39:46,988 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-08 14:39:46,990 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-08 14:39:47,435 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-08 14:39:47,438 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-08 14:39:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,441 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-08 14:39:47,446 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-08 14:39:47,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:47,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:47,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:47,458 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-08 14:39:47,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-09-08 14:39:47,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,499 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-08 14:39:47,501 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-08 14:39:47,502 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-08 14:39:47,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:47,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:47,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:47,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,528 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 [2023-09-08 14:39:47,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,529 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-08 14:39:47,531 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-08 14:39:47,533 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-08 14:39:47,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:47,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:47,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:47,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-09-08 14:39:47,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,572 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) [2023-09-08 14:39:47,573 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 [2023-09-08 14:39:47,576 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-08 14:39:47,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:47,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:47,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:47,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,599 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 [2023-09-08 14:39:47,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-08 14:39:47,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-09-08 14:39:47,620 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-08 14:39:47,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:47,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:47,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:47,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:47,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-08 14:39:47,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-09-08 14:39:47,650 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-08 14:39:47,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:47,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:47,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:47,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-08 14:39:47,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-09-08 14:39:47,681 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-08 14:39:47,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:47,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:47,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:47,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:47,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-08 14:39:47,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-09-08 14:39:47,742 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-08 14:39:47,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:47,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:47,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:47,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:47,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,755 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-08 14:39:47,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-09-08 14:39:47,759 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-08 14:39:47,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:47,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:47,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:47,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,832 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) [2023-09-08 14:39:47,864 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 [2023-09-08 14:39:47,865 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-08 14:39:47,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:47,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:47,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:47,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:47,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:47,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:47,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:47,932 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) [2023-09-08 14:39:47,973 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 [2023-09-08 14:39:47,974 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-08 14:39:47,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:47,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:47,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:47,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:47,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:47,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:47,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:48,005 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 [2023-09-08 14:39:48,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:48,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:48,021 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) [2023-09-08 14:39:48,024 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 [2023-09-08 14:39:48,025 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-08 14:39:48,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:48,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:48,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:48,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:48,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:48,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:48,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:48,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:48,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:48,056 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) [2023-09-08 14:39:48,058 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 [2023-09-08 14:39:48,059 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-08 14:39:48,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:48,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:48,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:48,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:48,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:48,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:48,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:48,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:48,086 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 [2023-09-08 14:39:48,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:48,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:48,088 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) [2023-09-08 14:39:48,090 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 [2023-09-08 14:39:48,092 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-08 14:39:48,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:48,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:48,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:48,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:48,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:48,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:48,122 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-08 14:39:48,149 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-09-08 14:39:48,149 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-09-08 14:39:48,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:48,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:48,200 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) [2023-09-08 14:39:48,201 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 [2023-09-08 14:39:48,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-08 14:39:48,237 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-08 14:39:48,237 INFO L513 LassoAnalysis]: Proved termination. [2023-09-08 14:39:48,238 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2023-09-08 14:39:48,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:48,298 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2023-09-08 14:39:48,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:39:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:39:48,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-08 14:39:48,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:39:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:39:48,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-08 14:39:48,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:39:48,451 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-08 14:39:48,480 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-09-08 14:39:48,482 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 14:39:50,358 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 [2023-09-08 14:39:50,920 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 162745 states and 474650 transitions. Complement of second has 10 states. [2023-09-08 14:39:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-08 14:39:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 14:39:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2023-09-08 14:39:50,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 250 transitions. Stem has 40 letters. Loop has 7 letters. [2023-09-08 14:39:50,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:39:50,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 250 transitions. Stem has 47 letters. Loop has 7 letters. [2023-09-08 14:39:50,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:39:50,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 250 transitions. Stem has 40 letters. Loop has 14 letters. [2023-09-08 14:39:50,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:39:50,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162745 states and 474650 transitions. [2023-09-08 14:39:53,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-09-08 14:39:53,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162745 states to 80 states and 84 transitions. [2023-09-08 14:39:53,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2023-09-08 14:39:53,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2023-09-08 14:39:53,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 84 transitions. [2023-09-08 14:39:53,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-08 14:39:53,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 84 transitions. [2023-09-08 14:39:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 84 transitions. [2023-09-08 14:39:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-09-08 14:39:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 78 states have internal predecessors, (83), 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-08 14:39:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2023-09-08 14:39:53,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 83 transitions. [2023-09-08 14:39:53,473 INFO L428 stractBuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2023-09-08 14:39:53,474 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-08 14:39:53,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 83 transitions. [2023-09-08 14:39:53,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-09-08 14:39:53,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:39:53,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:39:53,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:39:53,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:39:53,478 INFO L748 eck$LassoCheckResult]: Stem: 257833#[$Ultimate##0]don't care [445] $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] 257835#[L-1]don't care [451] L-1-->L-1-1: Formula: (= (select |v_#valid_17| 0) 0) InVars {#valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|} AuxVars[] AssignedVars[] 257849#[L-1-1]don't care [524] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 257829#[L21]don't care [397] L21-->L21-1: Formula: (and (= 1 (select |v_#valid_18| 1)) (= 2 (select |v_#length_13| 1))) InVars {#length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_13|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 257831#[L21-1]don't care [516] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_15| 1) 0) 48) InVars {#memory_int=|v_#memory_int_15|} OutVars{#memory_int=|v_#memory_int_15|} AuxVars[] AssignedVars[] 257861#[L21-2]don't care [456] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_16| 1) 1) 0) InVars {#memory_int=|v_#memory_int_16|} OutVars{#memory_int=|v_#memory_int_16|} AuxVars[] AssignedVars[] 257773#[L21-3]don't care [488] L21-3-->L21-4: Formula: (and (= (select |v_#valid_19| 2) 1) (= (select |v_#length_14| 2) 25)) InVars {#length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#length=|v_#length_14|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[] 257775#[L21-4]don't care [372] L21-4-->L41: Formula: (and (= v_~a1~0.base_5 0) (= v_~a1~0.offset_5 0)) InVars {} OutVars{~a1~0.offset=v_~a1~0.offset_5, ~a1~0.base=v_~a1~0.base_5} AuxVars[] AssignedVars[~a1~0.offset, ~a1~0.base] 257815#[L41]don't care [333] L41-->L42: Formula: (and (= v_~a2~0.offset_5 0) (= v_~a2~0.base_5 0)) InVars {} OutVars{~a2~0.offset=v_~a2~0.offset_5, ~a2~0.base=v_~a2~0.base_5} AuxVars[] AssignedVars[~a2~0.base, ~a2~0.offset] 257817#[L42]don't care [364] L42-->L42-1: Formula: (= v_~res1~0_6 0) InVars {} OutVars{~res1~0=v_~res1~0_6} AuxVars[] AssignedVars[~res1~0] 257867#[L42-1]don't care [517] L42-1-->L42-2: Formula: (= v_~res2~0_6 0) InVars {} OutVars{~res2~0=v_~res2~0_6} AuxVars[] AssignedVars[~res2~0] 257869#[L42-2]don't care [472] L42-2-->L42-3: Formula: (= v_~n1~0_7 0) InVars {} OutVars{~n1~0=v_~n1~0_7} AuxVars[] AssignedVars[~n1~0] 257799#[L42-3]don't care [441] L42-3-->L-1-2: Formula: (= v_~n2~0_7 0) InVars {} OutVars{~n2~0=v_~n2~0_7} AuxVars[] AssignedVars[~n2~0] 257801#[L-1-2]don't care [528] 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] 257879#[L-1-3]don't care [531] L-1-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_1|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_4|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_1|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_1|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 257881#[L76]don't care [373] L76-->L76-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#valid_21| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_20|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_15|) (= (select |v_#valid_21| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_16|, #valid=|v_#valid_21|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 257863#[L76-1]don't care [515] L76-1-->L76-2: Formula: (and (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_18|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 257865#[L76-2]don't care [520] L76-2-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 257793#[L78]don't care [328] L78-->L78-1: Formula: (= v_~n1~0_8 |v_ULTIMATE.start_main_#t~nondet13#1_3|) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ~n1~0=v_~n1~0_8} AuxVars[] AssignedVars[~n1~0] 257795#[L78-1]don't care [390] L78-1-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 257797#[L79]don't care [358] L79-->L79-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 257859#[L79-1]don't care [513] L79-1-->L79-2: Formula: (= v_~n2~0_8 |v_ULTIMATE.start_main_#t~nondet14#1_3|) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} OutVars{~n2~0=v_~n2~0_8, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[~n2~0] 257843#[L79-2]don't care [447] L79-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 257747#[L80]don't care [434] L80-->L80-1: Formula: (= v_~n1~0_9 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~n1~0=v_~n1~0_9} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n1~0=v_~n1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 257749#[L80-1]don't care [514] L80-1-->L80-2: 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] 257785#[L80-2]don't care [326] L80-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_1|, 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~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_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_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#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_#t~malloc23#1.offset, 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~malloc23#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_create_fresh_int_array_~size#1] 257741#[L97]don't care [483] L97-->L98: 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] 257743#[L98]don't care [497] L98-->L98-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (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_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 257759#[L98-1]don't care [435] L98-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 257761#[L37]don't care [366] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 257875#[L38]don't care [474] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 257877#[L37-1]don't care [464] L37-1-->L99: 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_9|) 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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 257851#[L99]don't care [402] L99-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 257777#[L37-2]don't care [438] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_18| |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_18|, 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] 257779#[L38-3]don't care [344] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_20| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[] 257837#[L37-3]don't care [335] L37-3-->L101: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 257839#[L101]don't care [519] L101-->L101-1: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_2|) (= (select |v_#valid_25| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_19|) (= |v_#valid_24| (store |v_#valid_25| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_2|, #valid=|v_#valid_24|, #length=|v_#length_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #valid, #length] 257791#[L101-1]don't care [439] L101-1-->L101-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_3|, 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 257769#[L101-2]don't care [383] L101-2-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base] 257771#[L102]don't care [350] L102-->L102-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] 257855#[L102-6]don't care [331] L102-6-->L102-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 257805#[L102-7]don't care [462] L102-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 257857#[create_fresh_int_array_returnLabel#1]don't care [511] create_fresh_int_array_returnLabel#1-->L80-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret15#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 257781#[L80-3]don't care [386] L80-3-->L80-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_3| v_~a1~0.base_6) (= v_~a1~0.offset_6 |v_ULTIMATE.start_main_#t~ret15#1.offset_3|)) InVars {ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|} OutVars{~a1~0.offset=v_~a1~0.offset_6, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ~a1~0.base=v_~a1~0.base_6, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|} AuxVars[] AssignedVars[~a1~0.offset, ~a1~0.base] 257783#[L80-4]don't care [359] L80-4-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_4|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 257871#[L81]don't care [523] L81-->L81-1: Formula: (= v_~n2~0_9 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {~n2~0=v_~n2~0_9} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ~n2~0=v_~n2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 257733#[L81-1]don't care [315] L81-1-->L81-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 257735#[L81-2]don't care [493] L81-2-->L97-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, 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~malloc23#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_create_fresh_int_array_~size#1] 257767#[L97-1]don't care [487] L97-1-->L98-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_9| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 257755#[L98-2]don't care [485] L98-2-->L98-3: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_10|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_10|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 257757#[L98-3]don't care [398] L98-3-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 257827#[L37-4]don't care [505] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_22| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_22|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 257819#[L38-6]don't care [395] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_24| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|} AuxVars[] AssignedVars[] 257751#[L37-5]don't care [379] L37-5-->L99-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_11| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 257753#[L99-1]don't care [351] L99-1-->L37-6: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 257725#[L37-6]don't care [477] L37-6-->L38-9: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_26| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_26|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 257727#[L38-9]don't care [413] L38-9-->L37-7: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_28| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|} AuxVars[] AssignedVars[] 257765#[L37-7]don't care [387] L37-7-->L101-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 257745#[L101-3]don't care [484] L101-3-->L101-4: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_6| |v_#StackHeapBarrier_5|) (= |v_#length_22| (store |v_#length_23| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_6| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_12| 1073741824) 4))) (= 0 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_6|) (= (select |v_#valid_28| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_6|) 0) (= (store |v_#valid_28| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_6| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_6| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_23|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_12|, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_6|, #valid=|v_#valid_27|, #length=|v_#length_22|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #valid, #length] 257729#[L101-4]don't care [316] L101-4-->L101-5: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_6| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_7|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_7|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_6|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 257731#[L101-5]don't care [365] L101-5-->L102-8: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base] 257873#[L102-8]don't care [521] L102-8-->L102-14: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 257813#[L102-14]don't care [2023-09-08 14:39:53,478 INFO L750 eck$LassoCheckResult]: Loop: 257813#[L102-14]don't care [508] L102-14-->L103-3: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_11| |v_ULTIMATE.start_create_fresh_int_array_~size#1_14|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_14|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_14|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_11|} AuxVars[] AssignedVars[] 257737#[L103-3]don't care [375] L103-3-->L103-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet25#1] 257739#[L103-4]don't care [448] L103-4-->L103-5: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_12| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_7| .cse1))) (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7| (store (select |v_#memory_int_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_7|)) |v_#memory_int_19|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_7| .cse1 4) (select |v_#length_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7|)) (= (select |v_#valid_29| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_12|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_19|, #length=|v_#length_24|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_12|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_7|} AuxVars[] AssignedVars[#memory_int] 257787#[L103-5]don't care [388] L103-5-->L102-11: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet25#1] 257789#[L102-11]don't care [360] L102-11-->L102-12: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_13| |v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_13|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post24#1] 257841#[L102-12]don't care [446] L102-12-->L102-13: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_14| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_7| 1)) InVars {ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 257811#[L102-13]don't care [392] L102-13-->L102-14: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post24#1] 257813#[L102-14]don't care [2023-09-08 14:39:53,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:39:53,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1664518350, now seen corresponding path program 1 times [2023-09-08 14:39:53,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:39:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529434700] [2023-09-08 14:39:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:39:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:39:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:53,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:39:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:53,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:39:53,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:39:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash -100199566, now seen corresponding path program 1 times [2023-09-08 14:39:53,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:39:53,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617447779] [2023-09-08 14:39:53,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:39:53,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:39:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:53,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:39:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:53,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:39:53,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:39:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2100853253, now seen corresponding path program 1 times [2023-09-08 14:39:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:39:53,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436332442] [2023-09-08 14:39:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:39:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:39:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:53,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:39:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:39:53,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:39:55,091 INFO L210 LassoAnalysis]: Preferences: [2023-09-08 14:39:55,091 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-08 14:39:55,091 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-08 14:39:55,091 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-08 14:39:55,091 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-08 14:39:55,091 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:55,091 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-08 14:39:55,091 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-08 14:39:55,091 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-array-int-symm.wvr.c_BEv2_Iteration2_Lasso [2023-09-08 14:39:55,091 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-08 14:39:55,091 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-08 14:39:55,094 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-08 14:39:55,098 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-08 14:39:55,100 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-08 14:39:55,102 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-08 14:39:55,103 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-08 14:39:55,397 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-08 14:39:55,400 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-08 14:39:55,401 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-08 14:39:55,403 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-08 14:39:55,405 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-08 14:39:55,406 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-08 14:39:55,408 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-08 14:39:55,409 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-08 14:39:55,411 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-08 14:39:55,413 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-08 14:39:55,415 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-08 14:39:55,417 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-08 14:39:55,418 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-08 14:39:55,420 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-08 14:39:55,421 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-08 14:39:55,423 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-08 14:39:55,424 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-08 14:39:55,426 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-08 14:39:55,427 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-08 14:39:55,429 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-08 14:39:55,430 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-08 14:39:55,432 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-08 14:39:55,435 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-08 14:39:55,437 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-08 14:39:55,438 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-08 14:39:55,440 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-08 14:39:55,441 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-08 14:39:55,442 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-08 14:39:55,443 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-08 14:39:55,445 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-08 14:39:55,915 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-08 14:39:55,916 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-08 14:39:55,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:55,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:55,917 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) [2023-09-08 14:39:55,928 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 [2023-09-08 14:39:55,929 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-08 14:39:55,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:55,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:55,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:55,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:55,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:55,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:55,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:55,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:55,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:55,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:55,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:55,941 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) [2023-09-08 14:39:55,966 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 [2023-09-08 14:39:55,967 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-08 14:39:55,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:55,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:55,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:55,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:55,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:55,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:55,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:55,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:55,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:55,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:55,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:55,997 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) [2023-09-08 14:39:55,999 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 [2023-09-08 14:39:56,000 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-08 14:39:56,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:56,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:56,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:56,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:56,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,024 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) [2023-09-08 14:39:56,028 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 [2023-09-08 14:39:56,029 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-08 14:39:56,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:39:56,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:39:56,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:39:56,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,041 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 [2023-09-08 14:39:56,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,042 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) [2023-09-08 14:39:56,043 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 [2023-09-08 14:39:56,047 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-08 14:39:56,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,056 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-09-08 14:39:56,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,073 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2023-09-08 14:39:56,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:56,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,117 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) [2023-09-08 14:39:56,119 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 [2023-09-08 14:39:56,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-08 14:39:56,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:56,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,160 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 [2023-09-08 14:39:56,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,161 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) [2023-09-08 14:39:56,165 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-08 14:39:56,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:56,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,177 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 [2023-09-08 14:39:56,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-09-08 14:39:56,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,180 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) [2023-09-08 14:39:56,186 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 [2023-09-08 14:39:56,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-08 14:39:56,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:56,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,202 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 [2023-09-08 14:39:56,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,203 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) [2023-09-08 14:39:56,205 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 [2023-09-08 14:39:56,207 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-08 14:39:56,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:56,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,259 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 [2023-09-08 14:39:56,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,278 INFO L229 MonitoredProcess]: Starting monitored process 26 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-08 14:39:56,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-09-08 14:39:56,281 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-08 14:39:56,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:56,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:56,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,310 INFO L229 MonitoredProcess]: Starting monitored process 27 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-08 14:39:56,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-09-08 14:39:56,314 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-08 14:39:56,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:56,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:56,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,350 INFO L229 MonitoredProcess]: Starting monitored process 28 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-08 14:39:56,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-09-08 14:39:56,353 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-08 14:39:56,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:56,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:39:56,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:56,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,379 INFO L229 MonitoredProcess]: Starting monitored process 29 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-08 14:39:56,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-09-08 14:39:56,382 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-08 14:39:56,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:39:56,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:39:56,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:39:56,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:39:56,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:39:56,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:39:56,418 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-08 14:39:56,431 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-09-08 14:39:56,431 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2023-09-08 14:39:56,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:39:56,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:39:56,442 INFO L229 MonitoredProcess]: Starting monitored process 30 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-08 14:39:56,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-09-08 14:39:56,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-08 14:39:56,452 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-08 14:39:56,452 INFO L513 LassoAnalysis]: Proved termination. [2023-09-08 14:39:56,452 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_2) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_2 Supporting invariants [] [2023-09-08 14:39:56,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:56,506 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2023-09-08 14:39:56,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:39:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:39:56,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-08 14:39:56,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:39:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:39:56,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-08 14:39:56,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:39:56,668 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-08 14:39:56,669 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-09-08 14:39:56,669 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 83 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-08 14:39:56,702 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 83 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 105 states and 111 transitions. Complement of second has 9 states. [2023-09-08 14:39:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-08 14:39:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-08 14:39:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2023-09-08 14:39:56,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 99 transitions. Stem has 62 letters. Loop has 7 letters. [2023-09-08 14:39:56,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:39:56,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 99 transitions. Stem has 69 letters. Loop has 7 letters. [2023-09-08 14:39:56,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:39:56,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 99 transitions. Stem has 62 letters. Loop has 14 letters. [2023-09-08 14:39:56,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:39:56,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 111 transitions. [2023-09-08 14:39:56,705 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-08 14:39:56,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 0 states and 0 transitions. [2023-09-08 14:39:56,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-08 14:39:56,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-08 14:39:56,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-08 14:39:56,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-08 14:39:56,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:39:56,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:39:56,706 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:39:56,706 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-09-08 14:39:56,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-08 14:39:56,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-08 14:39:56,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-08 14:39:56,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.09 02:39:56 BoogieIcfgContainer [2023-09-08 14:39:56,711 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-08 14:39:56,712 INFO L158 Benchmark]: Toolchain (without parser) took 16631.34ms. Allocated memory was 273.7MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 226.8MB in the beginning and 4.1GB in the end (delta: -3.8GB). Peak memory consumption was 650.1MB. Max. memory is 8.0GB. [2023-09-08 14:39:56,712 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory was 112.7MB in the beginning and 112.5MB in the end (delta: 180.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-09-08 14:39:56,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.05ms. Allocated memory is still 273.7MB. Free memory was 226.8MB in the beginning and 215.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-08 14:39:56,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.58ms. Allocated memory is still 273.7MB. Free memory was 214.8MB in the beginning and 212.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-08 14:39:56,713 INFO L158 Benchmark]: Boogie Preprocessor took 35.02ms. Allocated memory is still 273.7MB. Free memory was 212.7MB in the beginning and 211.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-08 14:39:56,713 INFO L158 Benchmark]: RCFGBuilder took 461.38ms. Allocated memory is still 273.7MB. Free memory was 211.1MB in the beginning and 189.6MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-09-08 14:39:56,713 INFO L158 Benchmark]: BuchiAutomizer took 15819.53ms. Allocated memory was 273.7MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 189.6MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 612.4MB. Max. memory is 8.0GB. [2023-09-08 14:39:56,715 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.09ms. Allocated memory is still 163.6MB. Free memory was 112.7MB in the beginning and 112.5MB in the end (delta: 180.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.05ms. Allocated memory is still 273.7MB. Free memory was 226.8MB in the beginning and 215.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.58ms. Allocated memory is still 273.7MB. Free memory was 214.8MB in the beginning and 212.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.02ms. Allocated memory is still 273.7MB. Free memory was 212.7MB in the beginning and 211.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 461.38ms. Allocated memory is still 273.7MB. Free memory was 211.1MB in the beginning and 189.6MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 15819.53ms. Allocated memory was 273.7MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 189.6MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 612.4MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 6 locations. One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.1s. Construction of modules took 0.0s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 2.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 126 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax114 hnf100 lsp74 ukn72 mio100 lsp37 div242 bol100 ite100 ukn100 eq147 hnf94 smp60 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 5 VariablesLoop: 0 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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-08 14:39:56,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-09-08 14:39:56,930 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...