/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/unroll-cond-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-08 14:49:01,800 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-08 14:49:01,860 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:49:01,892 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 14:49:01,892 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 14:49:01,893 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 14:49:01,894 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 14:49:01,894 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 14:49:01,895 INFO L137 SettingsManager]: * Use SBE=true [2023-09-08 14:49:01,898 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-08 14:49:01,898 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-08 14:49:01,898 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-08 14:49:01,898 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-08 14:49:01,899 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-08 14:49:01,900 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-08 14:49:01,900 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 14:49:01,900 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-08 14:49:01,900 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-08 14:49:01,900 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 14:49:01,901 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-08 14:49:01,901 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 14:49:01,901 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-08 14:49:01,902 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-08 14:49:01,902 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-08 14:49:01,902 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-08 14:49:01,903 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 14:49:01,903 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-08 14:49:01,903 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-08 14:49:01,903 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-08 14:49:01,903 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 14:49:01,904 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 14:49:01,904 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 14:49:01,904 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 14:49:01,905 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 14:49:01,906 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-08 14:49:01,906 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:49:02,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 14:49:02,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 14:49:02,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 14:49:02,135 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 14:49:02,136 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 14:49:02,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2023-09-08 14:49:03,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 14:49:03,346 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 14:49:03,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2023-09-08 14:49:03,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c97ecb1/c3ea984a2ec84311af7f207c444419a2/FLAGec06b333f [2023-09-08 14:49:03,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c97ecb1/c3ea984a2ec84311af7f207c444419a2 [2023-09-08 14:49:03,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 14:49:03,371 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 14:49:03,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 14:49:03,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 14:49:03,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 14:49:03,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61606af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03, skipping insertion in model container [2023-09-08 14:49:03,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-08 14:49:03,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-08 14:49:03,567 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2474,2487] [2023-09-08 14:49:03,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:49:03,587 INFO L203 MainTranslator]: Completed pre-run [2023-09-08 14:49:03,620 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2474,2487] [2023-09-08 14:49:03,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:49:03,637 INFO L208 MainTranslator]: Completed translation [2023-09-08 14:49:03,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03 WrapperNode [2023-09-08 14:49:03,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 14:49:03,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 14:49:03,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 14:49:03,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 14:49:03,645 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:49:03" (1/1) ... [2023-09-08 14:49:03,659 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:49:03" (1/1) ... [2023-09-08 14:49:03,685 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 142 [2023-09-08 14:49:03,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 14:49:03,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 14:49:03,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 14:49:03,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 14:49:03,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 14:49:03,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 14:49:03,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 14:49:03,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 14:49:03,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (1/1) ... [2023-09-08 14:49:03,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:49:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:49:03,759 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:49:03,777 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:49:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 14:49:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 14:49:03,792 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 14:49:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 14:49:03,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 14:49:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 14:49:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 14:49:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 14:49:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-08 14:49:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 14:49:03,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 14:49:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 14:49:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 14:49:03,795 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:49:03,890 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 14:49:03,892 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 14:49:04,169 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 14:49:04,176 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 14:49:04,176 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-08 14:49:04,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:49:04 BoogieIcfgContainer [2023-09-08 14:49:04,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 14:49:04,178 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-08 14:49:04,178 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-08 14:49:04,181 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-08 14:49:04,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:49:04,182 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.09 02:49:03" (1/3) ... [2023-09-08 14:49:04,183 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66a040fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:49:04, skipping insertion in model container [2023-09-08 14:49:04,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:49:04,183 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:03" (2/3) ... [2023-09-08 14:49:04,183 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66a040fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:49:04, skipping insertion in model container [2023-09-08 14:49:04,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:49:04,183 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:49:04" (3/3) ... [2023-09-08 14:49:04,184 INFO L332 chiAutomizerObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2023-09-08 14:49:04,262 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 14:49:04,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 344 flow [2023-09-08 14:49:04,362 INFO L124 PetriNetUnfolderBase]: 15/160 cut-off events. [2023-09-08 14:49:04,363 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-09-08 14:49:04,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 160 events. 15/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 201 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-09-08 14:49:04,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 344 flow [2023-09-08 14:49:04,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 160 transitions, 332 flow [2023-09-08 14:49:04,387 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-08 14:49:04,388 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-08 14:49:04,388 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-08 14:49:04,388 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-08 14:49:04,388 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-08 14:49:04,388 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-08 14:49:04,388 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-08 14:49:04,388 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-08 14:49:04,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-08 14:49:05,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-09-08 14:49:05,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:49:05,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:49:05,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:49:05,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:49:05,522 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-08 14:49:05,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-08 14:49:06,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-09-08 14:49:06,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:49:06,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:49:06,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:49:06,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:49:06,145 INFO L748 eck$LassoCheckResult]: Stem: 164#[$Ultimate##0]don't care [257] $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] 169#[L-1]don't care [264] L-1-->L-1-1: Formula: (= (select |v_#valid_16| 0) 0) InVars {#valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|} AuxVars[] AssignedVars[] 173#[L-1-1]don't care [371] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 176#[L21]don't care [328] L21-->L21-1: Formula: (and (= 2 (select |v_#length_12| 1)) (= (select |v_#valid_17| 1) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_17|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[] 179#[L21-1]don't care [354] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 182#[L21-2]don't care [270] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 185#[L21-3]don't care [318] L21-3-->L21-4: Formula: (and (= (select |v_#valid_18| 2) 1) (= (select |v_#length_13| 2) 20)) InVars {#length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_13|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 188#[L21-4]don't care [295] L21-4-->L42: Formula: (and (= v_~f~0.base_6 0) (= v_~f~0.offset_6 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_6, ~f~0.offset=v_~f~0.offset_6} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 191#[L42]don't care [284] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 194#[L42-1]don't care [356] L42-1-->L42-2: Formula: (= v_~x2~0_11 0) InVars {} OutVars{~x2~0=v_~x2~0_11} AuxVars[] AssignedVars[~x2~0] 197#[L42-2]don't care [293] L42-2-->L43: Formula: (= 0 v_~size~0_6) InVars {} OutVars{~size~0=v_~size~0_6} AuxVars[] AssignedVars[~size~0] 200#[L43]don't care [361] L43-->L-1-2: Formula: (= v_~n~0_7 0) InVars {} OutVars{~n~0=v_~n~0_7} AuxVars[] AssignedVars[~n~0] 203#[L-1-2]don't care [374] 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] 206#[L-1-3]don't care [380] L-1-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_4|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 209#[L76]don't care [298] L76-->L76-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_14|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, 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_19|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 212#[L76-1]don't care [352] L76-1-->L76-2: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_21|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= |v_#length_16| (store |v_#length_17| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_17|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, 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_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 215#[L76-2]don't care [362] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 218#[L79]don't care [279] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~n~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{~n~0=v_~n~0_8, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[~n~0] 221#[L79-1]don't care [350] L79-1-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 224#[L80]don't care [240] L80-->L80-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 227#[L80-1]don't care [351] L80-1-->L80-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~size~0_7) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~size~0=v_~size~0_7, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~size~0] 230#[L80-2]don't care [246] L80-2-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 233#[L81]don't care [369] L81-->L81-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (< 0 v_~size~0_8) 1 0)) InVars {~size~0=v_~size~0_8} OutVars{~size~0=v_~size~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 236#[L81-1]don't care [232] L81-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 239#[L37]don't care [287] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 242#[L38]don't care [297] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 248#[L37-1]don't care [288] L37-1-->L82: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~size~0_5) InVars {~size~0=v_~size~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 251#[L82]don't care [322] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 254#[L82-1]don't care [241] L82-1-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_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~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] 257#[L96]don't care [344] L96-->L97: 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] 260#[L97]don't care [309] L97-->L97-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| (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_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 263#[L97-1]don't care [317] L97-1-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 266#[L37-2]don't care [245] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 269#[L38-3]don't care [262] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 275#[L37-3]don't care [258] L37-3-->L98: 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_4|) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 278#[L98]don't care [332] L98-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 281#[L37-4]don't care [342] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 284#[L38-6]don't care [327] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 290#[L37-5]don't care [314] L37-5-->L100: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 293#[L100]don't care [283] L100-->L100-1: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2|) 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_5|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2| |v_#StackHeapBarrier_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2|, #valid=|v_#valid_5|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_2|, 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~malloc18#1.base, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset] 296#[L100-1]don't care [307] L100-1-->L100-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 299#[L100-2]don't care [330] L100-2-->L101: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset] 302#[L101]don't care [358] L101-->L101-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] 305#[L101-6]don't care [2023-09-08 14:49:06,148 INFO L750 eck$LassoCheckResult]: Loop: 305#[L101-6]don't care [383] L101-6-->L102: 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[] 311#[L102]don't care [266] L102-->L102-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 317#[L102-1]don't care [247] L102-1-->L102-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_5|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] 323#[L102-2]don't care [265] L102-2-->L101-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 329#[L101-3]don't care [310] L101-3-->L101-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post19#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~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#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~post19#1] 335#[L101-4]don't care [233] L101-4-->L101-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#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] 341#[L101-5]don't care [285] L101-5-->L101-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1] 305#[L101-6]don't care [2023-09-08 14:49:06,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:49:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash 674862080, now seen corresponding path program 1 times [2023-09-08 14:49:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:49:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146931263] [2023-09-08 14:49:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:49:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:49:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:49:06,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:49:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:49:06,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:49:06,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:49:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1616033068, now seen corresponding path program 1 times [2023-09-08 14:49:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:49:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141515274] [2023-09-08 14:49:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:49:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:49:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:49:06,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:49:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:49:06,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:49:06,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:49:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -66489267, now seen corresponding path program 1 times [2023-09-08 14:49:06,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:49:06,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633888650] [2023-09-08 14:49:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:49:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:49:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:49:06,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:49:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:49:06,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:49:07,354 INFO L210 LassoAnalysis]: Preferences: [2023-09-08 14:49:07,355 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-08 14:49:07,355 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-08 14:49:07,355 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-08 14:49:07,355 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-08 14:49:07,355 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:49:07,355 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-08 14:49:07,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-08 14:49:07,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-2.wvr.c_BEv2_Iteration1_Lasso [2023-09-08 14:49:07,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-08 14:49:07,356 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-08 14:49:07,369 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:49:07,375 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:49:07,377 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:49:07,380 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:49:07,689 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:49:07,692 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:49:07,694 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:49:07,697 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:49:07,699 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:49:07,701 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:49:07,703 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:49:07,706 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:49:07,708 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:49:07,710 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:49:07,712 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:49:07,714 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:49:07,716 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:49:07,719 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:49:07,733 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:49:07,735 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:49:07,737 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:49:07,739 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:49:07,741 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:49:07,744 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:49:07,746 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:49:07,748 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:49:07,750 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:49:07,751 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:49:07,753 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:49:07,755 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:49:07,757 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:49:07,758 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:49:07,760 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:49:08,217 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-08 14:49:08,221 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-08 14:49:08,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:49:08,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:49:08,236 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:49:08,237 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:49:08,245 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:49:08,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:49:08,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:49:08,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:49:08,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:49:08,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:49:08,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:49:08,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:49:08,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:49:08,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-09-08 14:49:08,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:49:08,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:49:08,264 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:49:08,268 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:49:08,269 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:49:08,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:49:08,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:49:08,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:49:08,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:49:08,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:49:08,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:49:08,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:49:08,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:49:08,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-09-08 14:49:08,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:49:08,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:49:08,303 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:49:08,305 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:49:08,306 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:49:08,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:49:08,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:49:08,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:49:08,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:49:08,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:49:08,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:49:08,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:49:08,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-09-08 14:49:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:49:08,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:49:08,346 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:49:08,347 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:49:08,349 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:49:08,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:49:08,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:49:08,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:49:08,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:49:08,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:49:08,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:49:08,377 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-08 14:49:08,423 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-09-08 14:49:08,423 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-09-08 14:49:08,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:49:08,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:49:08,436 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:49:08,441 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:49:08,442 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-08 14:49:08,463 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-08 14:49:08,464 INFO L513 LassoAnalysis]: Proved termination. [2023-09-08 14:49:08,464 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~2#1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~2#1 Supporting invariants [] [2023-09-08 14:49:08,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-09-08 14:49:08,513 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2023-09-08 14:49:08,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:49:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:49:08,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-08 14:49:08,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:49:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:49:08,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-08 14:49:08,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:49:08,707 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:49:08,733 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:49:08,736 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 14:49:09,557 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:49:10,172 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 113450 states and 327077 transitions. Complement of second has 9 states. [2023-09-08 14:49:10,175 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:49:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 14:49:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 288 transitions. [2023-09-08 14:49:10,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 288 transitions. Stem has 43 letters. Loop has 7 letters. [2023-09-08 14:49:10,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:49:10,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 288 transitions. Stem has 50 letters. Loop has 7 letters. [2023-09-08 14:49:10,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:49:10,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 288 transitions. Stem has 43 letters. Loop has 14 letters. [2023-09-08 14:49:10,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:49:10,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113450 states and 327077 transitions. [2023-09-08 14:49:11,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-08 14:49:11,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113450 states to 0 states and 0 transitions. [2023-09-08 14:49:11,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-08 14:49:11,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-08 14:49:11,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-08 14:49:11,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-08 14:49:11,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:49:11,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:49:11,399 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:49:11,400 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-08 14:49:11,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-08 14:49:11,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-08 14:49:11,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-08 14:49:11,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.09 02:49:11 BoogieIcfgContainer [2023-09-08 14:49:11,405 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-08 14:49:11,406 INFO L158 Benchmark]: Toolchain (without parser) took 8034.12ms. Allocated memory was 207.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 164.9MB in the beginning and 1.1GB in the end (delta: -970.0MB). Peak memory consumption was 326.1MB. Max. memory is 8.0GB. [2023-09-08 14:49:11,406 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-08 14:49:11,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.42ms. Allocated memory is still 207.6MB. Free memory was 164.6MB in the beginning and 153.2MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-08 14:49:11,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.81ms. Allocated memory is still 207.6MB. Free memory was 153.2MB in the beginning and 151.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-08 14:49:11,407 INFO L158 Benchmark]: Boogie Preprocessor took 35.54ms. Allocated memory is still 207.6MB. Free memory was 151.4MB in the beginning and 149.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-08 14:49:11,408 INFO L158 Benchmark]: RCFGBuilder took 454.59ms. Allocated memory is still 207.6MB. Free memory was 149.7MB in the beginning and 132.2MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-09-08 14:49:11,408 INFO L158 Benchmark]: BuchiAutomizer took 7226.81ms. Allocated memory was 207.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 132.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 293.6MB. Max. memory is 8.0GB. [2023-09-08 14:49:11,410 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 207.6MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.42ms. Allocated memory is still 207.6MB. Free memory was 164.6MB in the beginning and 153.2MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.81ms. Allocated memory is still 207.6MB. Free memory was 153.2MB in the beginning and 151.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.54ms. Allocated memory is still 207.6MB. Free memory was 151.4MB in the beginning and 149.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 454.59ms. Allocated memory is still 207.6MB. Free memory was 149.7MB in the beginning and 132.2MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 7226.81ms. Allocated memory was 207.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 132.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 293.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 1.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 352 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 123 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax115 hnf100 lsp73 ukn73 mio100 lsp40 div242 bol100 ite100 ukn100 eq147 hnf94 smp60 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-08 14:49:11,426 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...