/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/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:19:38,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:19:38,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:19:38,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:19:38,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:19:38,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:19:38,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:19:38,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:19:38,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:19:38,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:19:38,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:19:38,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:19:38,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:19:38,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:19:38,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:19:38,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:19:38,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:19:38,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:19:38,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:19:38,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:19:38,359 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:19:38,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:19:38,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:19:38,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:19:38,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:19:38,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:19:38,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:19:38,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:19:38,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:19:38,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:19:38,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:19:38,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:19:38,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:19:38,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:19:38,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:19:38,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:19:38,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:19:38,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:19:38,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:19:38,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:19:38,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:19:38,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:19:38,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:19:38,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:19:38,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:19:38,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:19:38,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:19:38,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:19:38,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:19:38,402 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:19:38,402 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:19:38,402 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:19:38,402 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:19:38,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:19:38,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:19:38,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:19:38,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:19:38,404 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:19:38,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:19:38,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:19:38,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:19:38,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:19:38,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:19:38,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:19:38,404 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:19:38,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:19:38,405 INFO L138 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 [2022-07-26 14:19:38,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:19:38,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:19:38,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:19:38,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:19:38,613 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:19:38,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-07-26 14:19:38,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af167de50/683eb0c3cd284b4fb89eedf61ba92c4b/FLAG22b03da41 [2022-07-26 14:19:38,977 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:19:38,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-07-26 14:19:38,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af167de50/683eb0c3cd284b4fb89eedf61ba92c4b/FLAG22b03da41 [2022-07-26 14:19:39,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af167de50/683eb0c3cd284b4fb89eedf61ba92c4b [2022-07-26 14:19:39,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:19:39,401 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:19:39,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:19:39,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:19:39,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:19:39,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8f50aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39, skipping insertion in model container [2022-07-26 14:19:39,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:19:39,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:19:39,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-07-26 14:19:39,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:19:39,591 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:19:39,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-07-26 14:19:39,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:19:39,617 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:19:39,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39 WrapperNode [2022-07-26 14:19:39,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:19:39,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:19:39,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:19:39,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:19:39,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,647 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 193 [2022-07-26 14:19:39,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:19:39,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:19:39,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:19:39,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:19:39,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:19:39,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:19:39,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:19:39,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:19:39,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (1/1) ... [2022-07-26 14:19:39,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:39,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:39,693 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) [2022-07-26 14:19:39,698 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 [2022-07-26 14:19:39,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:19:39,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:19:39,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:19:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:19:39,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:19:39,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:19:39,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:19:39,719 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:19:39,773 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:19:39,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:19:40,041 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:19:40,142 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:19:40,143 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-26 14:19:40,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:19:40 BoogieIcfgContainer [2022-07-26 14:19:40,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:19:40,149 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:19:40,149 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:19:40,151 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:19:40,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:19:40,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:19:39" (1/3) ... [2022-07-26 14:19:40,153 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17e14717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:19:40, skipping insertion in model container [2022-07-26 14:19:40,153 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:19:40,153 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:39" (2/3) ... [2022-07-26 14:19:40,153 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17e14717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:19:40, skipping insertion in model container [2022-07-26 14:19:40,153 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:19:40,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:19:40" (3/3) ... [2022-07-26 14:19:40,154 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-07-26 14:19:40,234 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:19:40,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 164 places, 172 transitions, 360 flow [2022-07-26 14:19:40,296 INFO L129 PetriNetUnfolder]: 13/168 cut-off events. [2022-07-26 14:19:40,296 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:19:40,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 13/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-07-26 14:19:40,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 172 transitions, 360 flow [2022-07-26 14:19:40,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 168 transitions, 348 flow [2022-07-26 14:19:40,307 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:19:40,314 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 168 transitions, 348 flow [2022-07-26 14:19:40,315 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 168 transitions, 348 flow [2022-07-26 14:19:40,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 162 places, 168 transitions, 348 flow [2022-07-26 14:19:40,339 INFO L129 PetriNetUnfolder]: 13/168 cut-off events. [2022-07-26 14:19:40,340 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:19:40,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 13/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-07-26 14:19:40,341 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2022-07-26 14:19:44,831 INFO L131 LiptonReduction]: Checked pairs total: 820 [2022-07-26 14:19:44,831 INFO L133 LiptonReduction]: Total number of compositions: 182 [2022-07-26 14:19:44,843 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:19:44,843 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:19:44,844 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:19:44,844 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:19:44,844 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:19:44,844 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:19:44,844 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:19:44,844 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:19:44,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:19:44,865 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 26 [2022-07-26 14:19:44,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:44,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:44,869 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:19:44,869 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:44,869 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:19:44,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 35 states, but on-demand construction may add more states [2022-07-26 14:19:44,872 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 26 [2022-07-26 14:19:44,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:44,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:44,872 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:19:44,872 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:44,875 INFO L733 eck$LassoCheckResult]: Stem: 167#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 170#[L112-6]don't care [2022-07-26 14:19:44,876 INFO L735 eck$LassoCheckResult]: Loop: 170#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 170#[L112-6]don't care [2022-07-26 14:19:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash 790, now seen corresponding path program 1 times [2022-07-26 14:19:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:44,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588799211] [2022-07-26 14:19:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:44,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:44,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash 745, now seen corresponding path program 1 times [2022-07-26 14:19:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:44,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183052436] [2022-07-26 14:19:44,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:44,994 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:44,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 25204, now seen corresponding path program 1 times [2022-07-26 14:19:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:45,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885377256] [2022-07-26 14:19:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:45,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:45,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:45,479 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:45,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:45,479 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:45,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:45,479 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:45,480 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:45,480 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:45,480 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:45,480 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-two-queue.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:19:45,480 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:45,480 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:45,494 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,497 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,499 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,502 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,503 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,506 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,509 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,510 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,512 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,514 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,517 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,518 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,519 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,520 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,522 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,523 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,525 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,527 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,528 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,529 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,531 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,533 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,534 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,535 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,536 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,538 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,539 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,541 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,542 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,544 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,545 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,546 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,548 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,799 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,801 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,802 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,804 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,805 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,806 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,807 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:45,808 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:46,146 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:46,149 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:46,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,151 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) [2022-07-26 14:19:46,155 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 [2022-07-26 14:19:46,156 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 [2022-07-26 14:19:46,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,191 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 [2022-07-26 14:19:46,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,193 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) [2022-07-26 14:19:46,194 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 [2022-07-26 14:19:46,195 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 [2022-07-26 14:19:46,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,235 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 [2022-07-26 14:19:46,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,236 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) [2022-07-26 14:19:46,237 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 [2022-07-26 14:19:46,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:46,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,305 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 [2022-07-26 14:19:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,306 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) [2022-07-26 14:19:46,307 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 [2022-07-26 14:19:46,308 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 [2022-07-26 14:19:46,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,332 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 [2022-07-26 14:19:46,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,333 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) [2022-07-26 14:19:46,334 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 [2022-07-26 14:19:46,335 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 [2022-07-26 14:19:46,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,358 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 [2022-07-26 14:19:46,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,359 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) [2022-07-26 14:19:46,360 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 [2022-07-26 14:19:46,362 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 [2022-07-26 14:19:46,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,403 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 [2022-07-26 14:19:46,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,405 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) [2022-07-26 14:19:46,406 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 [2022-07-26 14:19:46,407 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 [2022-07-26 14:19:46,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,444 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 [2022-07-26 14:19:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,446 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) [2022-07-26 14:19:46,447 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 [2022-07-26 14:19:46,448 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 [2022-07-26 14:19:46,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,497 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 [2022-07-26 14:19:46,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,499 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) [2022-07-26 14:19:46,500 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 [2022-07-26 14:19:46,501 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 [2022-07-26 14:19:46,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,541 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 [2022-07-26 14:19:46,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,584 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) [2022-07-26 14:19:46,587 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 [2022-07-26 14:19:46,587 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 [2022-07-26 14:19:46,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,611 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 [2022-07-26 14:19:46,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,612 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) [2022-07-26 14:19:46,612 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 [2022-07-26 14:19:46,614 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 [2022-07-26 14:19:46,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,636 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 [2022-07-26 14:19:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,637 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) [2022-07-26 14:19:46,638 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 [2022-07-26 14:19:46,639 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 [2022-07-26 14:19:46,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-26 14:19:46,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,665 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) [2022-07-26 14:19:46,665 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 [2022-07-26 14:19:46,667 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 [2022-07-26 14:19:46,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,698 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 [2022-07-26 14:19:46,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,699 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) [2022-07-26 14:19:46,700 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 [2022-07-26 14:19:46,701 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 [2022-07-26 14:19:46,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,740 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 [2022-07-26 14:19:46,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,742 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) [2022-07-26 14:19:46,742 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 [2022-07-26 14:19:46,744 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 [2022-07-26 14:19:46,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,778 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 [2022-07-26 14:19:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,780 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) [2022-07-26 14:19:46,780 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 [2022-07-26 14:19:46,782 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 [2022-07-26 14:19:46,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,806 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 [2022-07-26 14:19:46,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,807 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) [2022-07-26 14:19:46,809 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 [2022-07-26 14:19:46,811 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 [2022-07-26 14:19:46,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,837 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 [2022-07-26 14:19:46,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,839 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) [2022-07-26 14:19:46,840 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 [2022-07-26 14:19:46,840 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 [2022-07-26 14:19:46,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-26 14:19:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,864 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) [2022-07-26 14:19:46,869 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 [2022-07-26 14:19:46,869 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 [2022-07-26 14:19:46,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,908 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 [2022-07-26 14:19:46,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,909 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) [2022-07-26 14:19:46,914 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 [2022-07-26 14:19:46,915 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 [2022-07-26 14:19:46,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:46,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:46,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:46,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,938 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 [2022-07-26 14:19:46,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,939 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) [2022-07-26 14:19:46,940 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 [2022-07-26 14:19:46,941 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 [2022-07-26 14:19:46,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-26 14:19:46,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,966 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) [2022-07-26 14:19:46,967 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 [2022-07-26 14:19:46,968 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 [2022-07-26 14:19:46,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:46,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:46,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:46,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:46,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:46,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:46,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:46,993 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 [2022-07-26 14:19:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:46,994 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) [2022-07-26 14:19:46,995 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 [2022-07-26 14:19:46,996 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 [2022-07-26 14:19:47,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:47,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:47,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:47,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-26 14:19:47,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,023 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) [2022-07-26 14:19:47,024 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 [2022-07-26 14:19:47,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 [2022-07-26 14:19:47,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:47,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:47,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:47,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,047 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 [2022-07-26 14:19:47,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,048 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) [2022-07-26 14:19:47,049 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 [2022-07-26 14:19:47,050 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 [2022-07-26 14:19:47,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:47,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:47,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:47,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-26 14:19:47,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,076 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) [2022-07-26 14:19:47,076 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 [2022-07-26 14:19:47,077 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 [2022-07-26 14:19:47,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-26 14:19:47,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,114 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) [2022-07-26 14:19:47,114 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 [2022-07-26 14:19:47,116 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 [2022-07-26 14:19:47,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-26 14:19:47,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,142 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) [2022-07-26 14:19:47,142 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 [2022-07-26 14:19:47,144 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 [2022-07-26 14:19:47,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:47,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:47,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:47,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,168 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 [2022-07-26 14:19:47,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,169 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) [2022-07-26 14:19:47,170 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 [2022-07-26 14:19:47,171 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 [2022-07-26 14:19:47,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-26 14:19:47,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,207 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2022-07-26 14:19:47,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 14:19:47,209 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 [2022-07-26 14:19:47,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:47,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:47,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:47,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-26 14:19:47,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,232 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2022-07-26 14:19:47,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 14:19:47,234 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 [2022-07-26 14:19:47,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:47,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,259 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2022-07-26 14:19:47,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 14:19:47,261 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 [2022-07-26 14:19:47,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-26 14:19:47,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,286 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2022-07-26 14:19:47,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 14:19:47,288 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 [2022-07-26 14:19:47,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:47,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,328 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2022-07-26 14:19:47,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 14:19:47,330 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 [2022-07-26 14:19:47,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:47,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,363 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2022-07-26 14:19:47,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 14:19:47,365 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 [2022-07-26 14:19:47,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:47,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 14:19:47,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,406 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2022-07-26 14:19:47,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 14:19:47,408 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 [2022-07-26 14:19:47,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:47,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:47,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:47,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:47,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:47,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:47,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:47,481 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-26 14:19:47,481 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-26 14:19:47,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:47,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:47,483 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2022-07-26 14:19:47,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 14:19:47,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:47,508 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:19:47,508 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:47,509 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-26 14:19:47,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:47,593 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-26 14:19:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:47,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:19:47,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:47,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:19:47,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:47,667 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:19:47,668 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 35 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-26 14:19:47,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 35 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 38 states and 81 transitions. Complement of second has 3 states. [2022-07-26 14:19:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-26 14:19:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-26 14:19:47,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:19:47,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:47,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:19:47,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:47,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:19:47,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:47,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 81 transitions. [2022-07-26 14:19:47,714 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 25 [2022-07-26 14:19:47,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 32 states and 70 transitions. [2022-07-26 14:19:47,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-26 14:19:47,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-26 14:19:47,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 70 transitions. [2022-07-26 14:19:47,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:47,719 INFO L220 hiAutomatonCegarLoop]: Abstraction has 32 states and 70 transitions. [2022-07-26 14:19:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 70 transitions. [2022-07-26 14:19:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-07-26 14:19:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 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) [2022-07-26 14:19:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 68 transitions. [2022-07-26 14:19:47,738 INFO L242 hiAutomatonCegarLoop]: Abstraction has 31 states and 68 transitions. [2022-07-26 14:19:47,738 INFO L426 stractBuchiCegarLoop]: Abstraction has 31 states and 68 transitions. [2022-07-26 14:19:47,738 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:19:47,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 68 transitions. [2022-07-26 14:19:47,740 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 25 [2022-07-26 14:19:47,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:47,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:47,740 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-26 14:19:47,740 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:47,740 INFO L733 eck$LassoCheckResult]: Stem: 402#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 404#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 408#[L112-14]don't care [2022-07-26 14:19:47,742 INFO L735 eck$LassoCheckResult]: Loop: 408#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 408#[L112-14]don't care [2022-07-26 14:19:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash 25242, now seen corresponding path program 1 times [2022-07-26 14:19:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:47,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991635768] [2022-07-26 14:19:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:47,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:47,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:47,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:47,785 INFO L85 PathProgramCache]: Analyzing trace with hash 746, now seen corresponding path program 1 times [2022-07-26 14:19:47,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:47,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291323467] [2022-07-26 14:19:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:47,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:47,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:47,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:47,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash 783217, now seen corresponding path program 1 times [2022-07-26 14:19:47,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:47,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869715212] [2022-07-26 14:19:47,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:47,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:47,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:47,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:48,638 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:48,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:48,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:48,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:48,639 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:48,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:48,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:48,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:48,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-two-queue.wvr.c_BEv2_Iteration2_Lasso [2022-07-26 14:19:48,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:48,639 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:48,644 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,646 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,648 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,650 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,651 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,653 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,654 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,657 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,659 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,661 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,662 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,664 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,665 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,667 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,668 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,670 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,671 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,672 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,674 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,675 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,676 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,678 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,680 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,684 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,685 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,686 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,688 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,690 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,691 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,954 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,956 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,958 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,959 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,960 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,962 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,963 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,965 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,966 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:48,968 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:49,353 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:49,353 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:49,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,354 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2022-07-26 14:19:49,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-26 14:19:49,356 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 [2022-07-26 14:19:49,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,400 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2022-07-26 14:19:49,405 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 [2022-07-26 14:19:49,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:49,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:49,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-26 14:19:49,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,444 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2022-07-26 14:19:49,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-26 14:19:49,447 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 [2022-07-26 14:19:49,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,486 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2022-07-26 14:19:49,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-26 14:19:49,488 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 [2022-07-26 14:19:49,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:49,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:49,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,523 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2022-07-26 14:19:49,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-26 14:19:49,525 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 [2022-07-26 14:19:49,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:49,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:49,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-26 14:19:49,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,550 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2022-07-26 14:19:49,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-26 14:19:49,552 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 [2022-07-26 14:19:49,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,576 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2022-07-26 14:19:49,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-26 14:19:49,578 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 [2022-07-26 14:19:49,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:49,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:49,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-26 14:19:49,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,605 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2022-07-26 14:19:49,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-26 14:19:49,607 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 [2022-07-26 14:19:49,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:49,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:49,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-26 14:19:49,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,633 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2022-07-26 14:19:49,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-26 14:19:49,635 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 [2022-07-26 14:19:49,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-26 14:19:49,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,658 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2022-07-26 14:19:49,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-26 14:19:49,659 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 [2022-07-26 14:19:49,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,693 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2022-07-26 14:19:49,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-26 14:19:49,695 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 [2022-07-26 14:19:49,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,726 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2022-07-26 14:19:49,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-26 14:19:49,728 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 [2022-07-26 14:19:49,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,751 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2022-07-26 14:19:49,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-26 14:19:49,752 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 [2022-07-26 14:19:49,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:49,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:49,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-26 14:19:49,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,789 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2022-07-26 14:19:49,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-26 14:19:49,790 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 [2022-07-26 14:19:49,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,828 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2022-07-26 14:19:49,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-26 14:19:49,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 [2022-07-26 14:19:49,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-26 14:19:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,891 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2022-07-26 14:19:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-26 14:19:49,893 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 [2022-07-26 14:19:49,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-26 14:19:49,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,916 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2022-07-26 14:19:49,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-26 14:19:49,917 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 [2022-07-26 14:19:49,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,940 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2022-07-26 14:19:49,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-26 14:19:49,941 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 [2022-07-26 14:19:49,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-26 14:19:49,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,964 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2022-07-26 14:19:49,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-26 14:19:49,966 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 [2022-07-26 14:19:49,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:49,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:49,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:49,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:49,990 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2022-07-26 14:19:49,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-26 14:19:49,992 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 [2022-07-26 14:19:49,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:49,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:49,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:49,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:49,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:49,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:49,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:49,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-26 14:19:50,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,014 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2022-07-26 14:19:50,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-26 14:19:50,017 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 [2022-07-26 14:19:50,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-26 14:19:50,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,055 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2022-07-26 14:19:50,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-26 14:19:50,057 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 [2022-07-26 14:19:50,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-26 14:19:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,081 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2022-07-26 14:19:50,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-26 14:19:50,083 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 [2022-07-26 14:19:50,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:50,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:50,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:50,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,117 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2022-07-26 14:19:50,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-26 14:19:50,119 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 [2022-07-26 14:19:50,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:50,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:50,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:50,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,164 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2022-07-26 14:19:50,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-26 14:19:50,166 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 [2022-07-26 14:19:50,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:50,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:50,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:50,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,205 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2022-07-26 14:19:50,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-26 14:19:50,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 [2022-07-26 14:19:50,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,246 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2022-07-26 14:19:50,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-26 14:19:50,248 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 [2022-07-26 14:19:50,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,287 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2022-07-26 14:19:50,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-26 14:19:50,289 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 [2022-07-26 14:19:50,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,348 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2022-07-26 14:19:50,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-26 14:19:50,350 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 [2022-07-26 14:19:50,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,396 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2022-07-26 14:19:50,403 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 [2022-07-26 14:19:50,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-26 14:19:50,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-26 14:19:50,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,439 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2022-07-26 14:19:50,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-26 14:19:50,441 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 [2022-07-26 14:19:50,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-26 14:19:50,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,465 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2022-07-26 14:19:50,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-26 14:19:50,467 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 [2022-07-26 14:19:50,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,491 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2022-07-26 14:19:50,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-26 14:19:50,493 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 [2022-07-26 14:19:50,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:50,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:50,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,518 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2022-07-26 14:19:50,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-26 14:19:50,520 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 [2022-07-26 14:19:50,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:50,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:50,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:50,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:50,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:50,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:50,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:50,565 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 14:19:50,565 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-26 14:19:50,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:50,566 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2022-07-26 14:19:50,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-26 14:19:50,568 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:50,573 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:19:50,573 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:50,573 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-26 14:19:50,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-26 14:19:50,638 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-26 14:19:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:50,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:19:50,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:50,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:19:50,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:50,679 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:19:50,679 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 68 transitions. cyclomatic complexity: 49 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2022-07-26 14:19:50,712 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 68 transitions. cyclomatic complexity: 49. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 133 transitions. Complement of second has 4 states. [2022-07-26 14:19:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2022-07-26 14:19:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-07-26 14:19:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:19:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-26 14:19:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-26 14:19:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:50,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 133 transitions. [2022-07-26 14:19:50,715 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:50,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 32 states and 70 transitions. [2022-07-26 14:19:50,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-26 14:19:50,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-26 14:19:50,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 70 transitions. [2022-07-26 14:19:50,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:50,716 INFO L220 hiAutomatonCegarLoop]: Abstraction has 32 states and 70 transitions. [2022-07-26 14:19:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 70 transitions. [2022-07-26 14:19:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-26 14:19:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 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) [2022-07-26 14:19:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 70 transitions. [2022-07-26 14:19:50,718 INFO L242 hiAutomatonCegarLoop]: Abstraction has 32 states and 70 transitions. [2022-07-26 14:19:50,718 INFO L426 stractBuchiCegarLoop]: Abstraction has 32 states and 70 transitions. [2022-07-26 14:19:50,718 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:19:50,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 70 transitions. [2022-07-26 14:19:50,718 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:50,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:50,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:50,719 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:19:50,719 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:50,719 INFO L733 eck$LassoCheckResult]: Stem: 630#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 632#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 636#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 610#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 612#[L47-1, L96-4]don't care [2022-07-26 14:19:50,720 INFO L735 eck$LassoCheckResult]: Loop: 612#[L47-1, L96-4]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 642#[L52, L96-4]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 612#[L47-1, L96-4]don't care [2022-07-26 14:19:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash 24281043, now seen corresponding path program 1 times [2022-07-26 14:19:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:50,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681578200] [2022-07-26 14:19:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:50,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:50,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash 21710, now seen corresponding path program 1 times [2022-07-26 14:19:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:50,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967688791] [2022-07-26 14:19:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:50,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:50,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1859266592, now seen corresponding path program 1 times [2022-07-26 14:19:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:50,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746183514] [2022-07-26 14:19:50,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:50,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746183514] [2022-07-26 14:19:50,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746183514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:50,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:50,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 14:19:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870540918] [2022-07-26 14:19:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:50,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:19:50,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:19:50,957 INFO L87 Difference]: Start difference. First operand 32 states and 70 transitions. cyclomatic complexity: 50 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:51,017 INFO L93 Difference]: Finished difference Result 51 states and 98 transitions. [2022-07-26 14:19:51,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 98 transitions. [2022-07-26 14:19:51,020 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:51,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 32 states and 69 transitions. [2022-07-26 14:19:51,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-26 14:19:51,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-26 14:19:51,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 69 transitions. [2022-07-26 14:19:51,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:51,021 INFO L220 hiAutomatonCegarLoop]: Abstraction has 32 states and 69 transitions. [2022-07-26 14:19:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 69 transitions. [2022-07-26 14:19:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-26 14:19:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 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) [2022-07-26 14:19:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 69 transitions. [2022-07-26 14:19:51,026 INFO L242 hiAutomatonCegarLoop]: Abstraction has 32 states and 69 transitions. [2022-07-26 14:19:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:19:51,027 INFO L426 stractBuchiCegarLoop]: Abstraction has 32 states and 69 transitions. [2022-07-26 14:19:51,027 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:19:51,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 69 transitions. [2022-07-26 14:19:51,029 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:51,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:51,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:51,029 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:19:51,029 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:51,030 INFO L733 eck$LassoCheckResult]: Stem: 752#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 754#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 762#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 766#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 736#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 738#[L47-1, L96-4]don't care [2022-07-26 14:19:51,030 INFO L735 eck$LassoCheckResult]: Loop: 738#[L47-1, L96-4]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 768#[L52, L96-4]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 738#[L47-1, L96-4]don't care [2022-07-26 14:19:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash 752695018, now seen corresponding path program 1 times [2022-07-26 14:19:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836282263] [2022-07-26 14:19:51,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash 21710, now seen corresponding path program 2 times [2022-07-26 14:19:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968954064] [2022-07-26 14:19:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1785427319, now seen corresponding path program 1 times [2022-07-26 14:19:51,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99695616] [2022-07-26 14:19:51,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 14:19:51,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:51,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99695616] [2022-07-26 14:19:51,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99695616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:51,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:51,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:19:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267570603] [2022-07-26 14:19:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:19:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:19:51,276 INFO L87 Difference]: Start difference. First operand 32 states and 69 transitions. cyclomatic complexity: 49 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-07-26 14:19:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:51,327 INFO L93 Difference]: Finished difference Result 53 states and 100 transitions. [2022-07-26 14:19:51,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 100 transitions. [2022-07-26 14:19:51,327 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:51,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 32 states and 68 transitions. [2022-07-26 14:19:51,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-26 14:19:51,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-26 14:19:51,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 68 transitions. [2022-07-26 14:19:51,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:51,328 INFO L220 hiAutomatonCegarLoop]: Abstraction has 32 states and 68 transitions. [2022-07-26 14:19:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 68 transitions. [2022-07-26 14:19:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-26 14:19:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 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) [2022-07-26 14:19:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 68 transitions. [2022-07-26 14:19:51,330 INFO L242 hiAutomatonCegarLoop]: Abstraction has 32 states and 68 transitions. [2022-07-26 14:19:51,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:19:51,332 INFO L426 stractBuchiCegarLoop]: Abstraction has 32 states and 68 transitions. [2022-07-26 14:19:51,332 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:19:51,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 68 transitions. [2022-07-26 14:19:51,332 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:51,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:51,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:51,332 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:19:51,332 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:51,333 INFO L733 eck$LassoCheckResult]: Stem: 884#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 886#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 890#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 892#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 894#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 864#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 866#[L47-1, L96-4]don't care [2022-07-26 14:19:51,333 INFO L735 eck$LassoCheckResult]: Loop: 866#[L47-1, L96-4]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 896#[L52, L96-4]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 866#[L47-1, L96-4]don't care [2022-07-26 14:19:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1824700232, now seen corresponding path program 1 times [2022-07-26 14:19:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490576177] [2022-07-26 14:19:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash 21710, now seen corresponding path program 3 times [2022-07-26 14:19:51,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175585370] [2022-07-26 14:19:51,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,361 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1190286933, now seen corresponding path program 1 times [2022-07-26 14:19:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434263908] [2022-07-26 14:19:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-26 14:19:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:51,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434263908] [2022-07-26 14:19:51,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434263908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:51,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:51,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-26 14:19:51,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332807562] [2022-07-26 14:19:51,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:51,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:19:51,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:19:51,493 INFO L87 Difference]: Start difference. First operand 32 states and 68 transitions. cyclomatic complexity: 48 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-07-26 14:19:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:51,515 INFO L93 Difference]: Finished difference Result 44 states and 91 transitions. [2022-07-26 14:19:51,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 91 transitions. [2022-07-26 14:19:51,516 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2022-07-26 14:19:51,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 40 states and 83 transitions. [2022-07-26 14:19:51,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-26 14:19:51,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-26 14:19:51,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 83 transitions. [2022-07-26 14:19:51,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:51,518 INFO L220 hiAutomatonCegarLoop]: Abstraction has 40 states and 83 transitions. [2022-07-26 14:19:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 83 transitions. [2022-07-26 14:19:51,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-07-26 14:19:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 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) [2022-07-26 14:19:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 76 transitions. [2022-07-26 14:19:51,520 INFO L242 hiAutomatonCegarLoop]: Abstraction has 36 states and 76 transitions. [2022-07-26 14:19:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:19:51,521 INFO L426 stractBuchiCegarLoop]: Abstraction has 36 states and 76 transitions. [2022-07-26 14:19:51,521 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:19:51,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 76 transitions. [2022-07-26 14:19:51,522 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2022-07-26 14:19:51,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:51,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:51,522 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:51,522 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:51,523 INFO L733 eck$LassoCheckResult]: Stem: 998#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1000#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1010#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1012#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1018#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 980#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 982#[L47-1, L96-4]don't care [688] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_9| 0) (not (< v_~i~0_47 v_~N~0_19)) (= |v_thread1Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~i~0=v_~i~0_47, ~N~0=v_~N~0_19} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_9|, ~i~0=v_~i~0_47, ~N~0=v_~N~0_19, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] 990#[thread1EXIT, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 992#[thread1EXIT, L97-3]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 1002#[L65-1, thread1EXIT, L97-4]don't care [2022-07-26 14:19:51,523 INFO L735 eck$LassoCheckResult]: Loop: 1002#[L65-1, thread1EXIT, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 1004#[thread1EXIT, L97-4, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 1002#[L65-1, thread1EXIT, L97-4]don't care [2022-07-26 14:19:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1755770176, now seen corresponding path program 1 times [2022-07-26 14:19:51,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883654816] [2022-07-26 14:19:51,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash 21833, now seen corresponding path program 1 times [2022-07-26 14:19:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750862404] [2022-07-26 14:19:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,593 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash 627029064, now seen corresponding path program 1 times [2022-07-26 14:19:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028014149] [2022-07-26 14:19:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-26 14:19:51,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:51,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028014149] [2022-07-26 14:19:51,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028014149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:51,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:51,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:19:51,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556384746] [2022-07-26 14:19:51,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:19:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:19:51,758 INFO L87 Difference]: Start difference. First operand 36 states and 76 transitions. cyclomatic complexity: 50 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:51,799 INFO L93 Difference]: Finished difference Result 48 states and 98 transitions. [2022-07-26 14:19:51,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 98 transitions. [2022-07-26 14:19:51,799 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2022-07-26 14:19:51,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 89 transitions. [2022-07-26 14:19:51,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2022-07-26 14:19:51,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-07-26 14:19:51,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 89 transitions. [2022-07-26 14:19:51,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:51,800 INFO L220 hiAutomatonCegarLoop]: Abstraction has 42 states and 89 transitions. [2022-07-26 14:19:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 89 transitions. [2022-07-26 14:19:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-07-26 14:19:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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) [2022-07-26 14:19:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2022-07-26 14:19:51,802 INFO L242 hiAutomatonCegarLoop]: Abstraction has 34 states and 70 transitions. [2022-07-26 14:19:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:19:51,812 INFO L426 stractBuchiCegarLoop]: Abstraction has 34 states and 70 transitions. [2022-07-26 14:19:51,812 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 14:19:51,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 70 transitions. [2022-07-26 14:19:51,812 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2022-07-26 14:19:51,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:51,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:51,812 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:51,812 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:51,813 INFO L733 eck$LassoCheckResult]: Stem: 1129#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1131#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1137#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1139#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1145#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1111#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1113#[L47-1, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 1133#[L47-1, L97-3]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 1135#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 1099#[L97-4, L47-1, L70]don't care [2022-07-26 14:19:51,813 INFO L735 eck$LassoCheckResult]: Loop: 1099#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 1097#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 1099#[L97-4, L47-1, L70]don't care [2022-07-26 14:19:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1755752212, now seen corresponding path program 1 times [2022-07-26 14:19:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824900837] [2022-07-26 14:19:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 21710, now seen corresponding path program 4 times [2022-07-26 14:19:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637035883] [2022-07-26 14:19:51,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash 644292345, now seen corresponding path program 1 times [2022-07-26 14:19:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:51,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055912097] [2022-07-26 14:19:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:51,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:53,709 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:53,710 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:53,710 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:53,710 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:53,710 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:53,710 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:53,710 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:53,710 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:53,710 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-two-queue.wvr.c_BEv2_Iteration7_Lasso [2022-07-26 14:19:53,710 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:53,710 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:53,713 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,835 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,836 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,837 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,839 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,840 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,842 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,844 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,854 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,856 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,857 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,858 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,859 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,860 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,862 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,863 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,864 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,866 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,867 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,869 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,870 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,872 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,873 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,874 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,876 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,879 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,880 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,882 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,883 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,885 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,886 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,888 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,890 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,891 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,892 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,894 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,895 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,897 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,898 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,900 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,901 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,902 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,904 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,905 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,909 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:54,912 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:55,552 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:55,552 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:55,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,553 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2022-07-26 14:19:55,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-26 14:19:55,555 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 [2022-07-26 14:19:55,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:55,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-26 14:19:55,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,583 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2022-07-26 14:19:55,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-26 14:19:55,586 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 [2022-07-26 14:19:55,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:55,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-26 14:19:55,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,610 INFO L229 MonitoredProcess]: Starting monitored process 76 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) [2022-07-26 14:19:55,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-26 14:19:55,612 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 [2022-07-26 14:19:55,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:55,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-26 14:19:55,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,643 INFO L229 MonitoredProcess]: Starting monitored process 77 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) [2022-07-26 14:19:55,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-26 14:19:55,645 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 [2022-07-26 14:19:55,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:55,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-26 14:19:55,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,670 INFO L229 MonitoredProcess]: Starting monitored process 78 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) [2022-07-26 14:19:55,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-26 14:19:55,672 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 [2022-07-26 14:19:55,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:55,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:55,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,716 INFO L229 MonitoredProcess]: Starting monitored process 79 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) [2022-07-26 14:19:55,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-26 14:19:55,717 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 [2022-07-26 14:19:55,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:55,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:55,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,742 INFO L229 MonitoredProcess]: Starting monitored process 80 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) [2022-07-26 14:19:55,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-26 14:19:55,744 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 [2022-07-26 14:19:55,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:55,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:55,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,776 INFO L229 MonitoredProcess]: Starting monitored process 81 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) [2022-07-26 14:19:55,787 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 [2022-07-26 14:19:55,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-26 14:19:55,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:55,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-26 14:19:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,810 INFO L229 MonitoredProcess]: Starting monitored process 82 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) [2022-07-26 14:19:55,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-26 14:19:55,813 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 [2022-07-26 14:19:55,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:55,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:55,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:55,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:55,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:55,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:55,844 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:55,859 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-26 14:19:55,859 INFO L444 ModelExtractionUtils]: 39 out of 58 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-07-26 14:19:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:55,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:55,860 INFO L229 MonitoredProcess]: Starting monitored process 83 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) [2022-07-26 14:19:55,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-26 14:19:55,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:55,867 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:19:55,867 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:55,868 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q1_front~0, ~q1_back~0) = -1*~q1_front~0 + 1*~q1_back~0 Supporting invariants [] [2022-07-26 14:19:55,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:56,009 INFO L156 tatePredicateManager]: 44 out of 44 supporting invariants were superfluous and have been removed [2022-07-26 14:19:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:56,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:19:56,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:56,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:19:56,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:56,065 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:19:56,065 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 70 transitions. cyclomatic complexity: 46 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:56,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 70 transitions. cyclomatic complexity: 46. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 95 states and 229 transitions. Complement of second has 5 states. [2022-07-26 14:19:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-07-26 14:19:56,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 14:19:56,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:56,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:19:56,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:56,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-26 14:19:56,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:56,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 229 transitions. [2022-07-26 14:19:56,099 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2022-07-26 14:19:56,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 73 states and 175 transitions. [2022-07-26 14:19:56,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-07-26 14:19:56,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-07-26 14:19:56,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 175 transitions. [2022-07-26 14:19:56,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:56,100 INFO L220 hiAutomatonCegarLoop]: Abstraction has 73 states and 175 transitions. [2022-07-26 14:19:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 175 transitions. [2022-07-26 14:19:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2022-07-26 14:19:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.517857142857143) internal successors, (141), 55 states have internal predecessors, (141), 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) [2022-07-26 14:19:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 141 transitions. [2022-07-26 14:19:56,103 INFO L242 hiAutomatonCegarLoop]: Abstraction has 56 states and 141 transitions. [2022-07-26 14:19:56,103 INFO L426 stractBuchiCegarLoop]: Abstraction has 56 states and 141 transitions. [2022-07-26 14:19:56,103 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-26 14:19:56,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 141 transitions. [2022-07-26 14:19:56,104 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2022-07-26 14:19:56,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:56,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:56,104 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:56,104 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:56,105 INFO L733 eck$LassoCheckResult]: Stem: 1534#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1536#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1546#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1548#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1562#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1514#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1516#[L47-1, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 1542#[L47-1, L97-3]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 1544#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 1574#[L97-4, L47-1, L70]don't care [688] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_9| 0) (not (< v_~i~0_47 v_~N~0_19)) (= |v_thread1Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~i~0=v_~i~0_47, ~N~0=v_~N~0_19} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_9|, ~i~0=v_~i~0_47, ~N~0=v_~N~0_19, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] 1540#[thread1EXIT, L97-4, L70]don't care [2022-07-26 14:19:56,105 INFO L735 eck$LassoCheckResult]: Loop: 1540#[thread1EXIT, L97-4, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 1538#[L65-1, thread1EXIT, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 1540#[thread1EXIT, L97-4, L70]don't care [2022-07-26 14:19:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1406256964, now seen corresponding path program 1 times [2022-07-26 14:19:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:56,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981257526] [2022-07-26 14:19:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-26 14:19:56,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981257526] [2022-07-26 14:19:56,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981257526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:56,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:56,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:19:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543757136] [2022-07-26 14:19:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:56,130 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:19:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash 22073, now seen corresponding path program 2 times [2022-07-26 14:19:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:56,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244671329] [2022-07-26 14:19:56,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:56,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:56,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:56,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:56,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:19:56,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:19:56,312 INFO L87 Difference]: Start difference. First operand 56 states and 141 transitions. cyclomatic complexity: 99 Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:56,363 INFO L93 Difference]: Finished difference Result 72 states and 174 transitions. [2022-07-26 14:19:56,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 174 transitions. [2022-07-26 14:19:56,363 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:56,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 174 transitions. [2022-07-26 14:19:56,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-26 14:19:56,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-26 14:19:56,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 174 transitions. [2022-07-26 14:19:56,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:56,365 INFO L220 hiAutomatonCegarLoop]: Abstraction has 72 states and 174 transitions. [2022-07-26 14:19:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 174 transitions. [2022-07-26 14:19:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2022-07-26 14:19:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.507936507936508) internal successors, (158), 62 states have internal predecessors, (158), 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) [2022-07-26 14:19:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 158 transitions. [2022-07-26 14:19:56,368 INFO L242 hiAutomatonCegarLoop]: Abstraction has 63 states and 158 transitions. [2022-07-26 14:19:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:19:56,370 INFO L426 stractBuchiCegarLoop]: Abstraction has 63 states and 158 transitions. [2022-07-26 14:19:56,370 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-26 14:19:56,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 158 transitions. [2022-07-26 14:19:56,371 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:56,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:56,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:56,371 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:56,371 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:56,372 INFO L733 eck$LassoCheckResult]: Stem: 1729#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1731#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1737#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1739#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1757#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1709#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1711#[L47-1, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 1733#[L47-1, L97-3]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 1735#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 1745#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 1749#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 1765#[L97-4, L47-1, L70]don't care [2022-07-26 14:19:56,372 INFO L735 eck$LassoCheckResult]: Loop: 1765#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 1793#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 1765#[L97-4, L47-1, L70]don't care [2022-07-26 14:19:56,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash 644292708, now seen corresponding path program 1 times [2022-07-26 14:19:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:56,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413505691] [2022-07-26 14:19:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:56,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 14:19:56,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:56,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413505691] [2022-07-26 14:19:56,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413505691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:19:56,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772288830] [2022-07-26 14:19:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:56,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:19:56,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:56,410 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:19:56,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-07-26 14:19:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:56,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:19:56,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 14:19:56,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:19:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 14:19:56,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772288830] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:19:56,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:19:56,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-26 14:19:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670700578] [2022-07-26 14:19:56,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:19:56,558 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:19:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash 22073, now seen corresponding path program 3 times [2022-07-26 14:19:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:56,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159872120] [2022-07-26 14:19:56,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:56,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:56,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:56,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-26 14:19:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-26 14:19:56,669 INFO L87 Difference]: Start difference. First operand 63 states and 158 transitions. cyclomatic complexity: 111 Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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) [2022-07-26 14:19:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:56,739 INFO L93 Difference]: Finished difference Result 108 states and 256 transitions. [2022-07-26 14:19:56,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 256 transitions. [2022-07-26 14:19:56,741 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:56,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 64 states and 159 transitions. [2022-07-26 14:19:56,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-07-26 14:19:56,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-07-26 14:19:56,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 159 transitions. [2022-07-26 14:19:56,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:56,742 INFO L220 hiAutomatonCegarLoop]: Abstraction has 64 states and 159 transitions. [2022-07-26 14:19:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 159 transitions. [2022-07-26 14:19:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-26 14:19:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.484375) internal successors, (159), 63 states have internal predecessors, (159), 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) [2022-07-26 14:19:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 159 transitions. [2022-07-26 14:19:56,745 INFO L242 hiAutomatonCegarLoop]: Abstraction has 64 states and 159 transitions. [2022-07-26 14:19:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-26 14:19:56,748 INFO L426 stractBuchiCegarLoop]: Abstraction has 64 states and 159 transitions. [2022-07-26 14:19:56,748 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-26 14:19:56,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 159 transitions. [2022-07-26 14:19:56,749 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 24 [2022-07-26 14:19:56,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:56,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:56,749 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:56,749 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:56,750 INFO L733 eck$LassoCheckResult]: Stem: 2038#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2040#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2046#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2048#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2064#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2066#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 2016#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 2018#[L47-1, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 2042#[L47-1, L97-3]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 2044#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 2090#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 2074#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 2052#[L97-4, L47-1, L70]don't care [2022-07-26 14:19:56,750 INFO L735 eck$LassoCheckResult]: Loop: 2052#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 2054#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 2052#[L97-4, L47-1, L70]don't care [2022-07-26 14:19:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:56,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1330224574, now seen corresponding path program 2 times [2022-07-26 14:19:56,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:56,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126496192] [2022-07-26 14:19:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:56,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-26 14:19:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:56,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126496192] [2022-07-26 14:19:56,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126496192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:56,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:56,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:19:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881781375] [2022-07-26 14:19:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:56,795 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:19:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 22073, now seen corresponding path program 4 times [2022-07-26 14:19:56,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:56,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428218307] [2022-07-26 14:19:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:56,799 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:56,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:56,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:19:56,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:19:56,918 INFO L87 Difference]: Start difference. First operand 64 states and 159 transitions. cyclomatic complexity: 111 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:56,940 INFO L93 Difference]: Finished difference Result 59 states and 138 transitions. [2022-07-26 14:19:56,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 138 transitions. [2022-07-26 14:19:56,941 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2022-07-26 14:19:56,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 138 transitions. [2022-07-26 14:19:56,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-26 14:19:56,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-26 14:19:56,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 138 transitions. [2022-07-26 14:19:56,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:56,942 INFO L220 hiAutomatonCegarLoop]: Abstraction has 59 states and 138 transitions. [2022-07-26 14:19:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 138 transitions. [2022-07-26 14:19:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-26 14:19:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.3389830508474576) internal successors, (138), 58 states have internal predecessors, (138), 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) [2022-07-26 14:19:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 138 transitions. [2022-07-26 14:19:56,944 INFO L242 hiAutomatonCegarLoop]: Abstraction has 59 states and 138 transitions. [2022-07-26 14:19:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:19:56,950 INFO L426 stractBuchiCegarLoop]: Abstraction has 59 states and 138 transitions. [2022-07-26 14:19:56,950 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-26 14:19:56,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 138 transitions. [2022-07-26 14:19:56,951 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20 [2022-07-26 14:19:56,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:56,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:56,951 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:56,951 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:56,952 INFO L733 eck$LassoCheckResult]: Stem: 2231#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2233#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2239#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2241#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2259#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2261#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 2209#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 2211#[L47-1, L96-4]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 2263#[L52, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 2219#[L97-3, L52]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 2221#[L65-1, L52, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 2271#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 2195#[L97-4, L47-1, L70]don't care [688] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_9| 0) (not (< v_~i~0_47 v_~N~0_19)) (= |v_thread1Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~i~0=v_~i~0_47, ~N~0=v_~N~0_19} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_9|, ~i~0=v_~i~0_47, ~N~0=v_~N~0_19, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] 2229#[thread1EXIT, L97-4, L70]don't care [2022-07-26 14:19:56,952 INFO L735 eck$LassoCheckResult]: Loop: 2229#[thread1EXIT, L97-4, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 2227#[L65-1, thread1EXIT, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 2229#[thread1EXIT, L97-4, L70]don't care [2022-07-26 14:19:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 3744691, now seen corresponding path program 1 times [2022-07-26 14:19:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:56,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388452741] [2022-07-26 14:19:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:56,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:57,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash 22073, now seen corresponding path program 5 times [2022-07-26 14:19:57,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:57,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428629227] [2022-07-26 14:19:57,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:57,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:57,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -696298133, now seen corresponding path program 1 times [2022-07-26 14:19:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:57,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427401146] [2022-07-26 14:19:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:57,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:57,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427401146] [2022-07-26 14:19:57,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427401146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:19:57,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906700334] [2022-07-26 14:19:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:57,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:19:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:57,619 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:19:57,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-07-26 14:19:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:57,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-26 14:19:57,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:57,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-26 14:19:57,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-26 14:19:57,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-26 14:19:58,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-26 14:19:58,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:19:58,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-26 14:19:58,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-26 14:19:58,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 37 [2022-07-26 14:19:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:58,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:19:59,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-26 14:19:59,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 77 [2022-07-26 14:19:59,086 INFO L356 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-07-26 14:19:59,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1008 treesize of output 952 [2022-07-26 14:19:59,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-26 14:19:59,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 832 treesize of output 664 [2022-07-26 14:19:59,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-26 14:19:59,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 640 treesize of output 622 [2022-07-26 14:20:34,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-26 14:20:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:20:34,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906700334] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:20:34,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:20:34,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-07-26 14:20:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853255251] [2022-07-26 14:20:34,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:20:34,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:20:34,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-26 14:20:34,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1248, Unknown=4, NotChecked=0, Total=1406 [2022-07-26 14:20:34,800 INFO L87 Difference]: Start difference. First operand 59 states and 138 transitions. cyclomatic complexity: 93 Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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) [2022-07-26 14:21:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:21:01,278 INFO L93 Difference]: Finished difference Result 168 states and 396 transitions. [2022-07-26 14:21:01,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 396 transitions. [2022-07-26 14:21:01,279 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 28 [2022-07-26 14:21:01,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 396 transitions. [2022-07-26 14:21:01,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2022-07-26 14:21:01,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2022-07-26 14:21:01,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 396 transitions. [2022-07-26 14:21:01,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:01,281 INFO L220 hiAutomatonCegarLoop]: Abstraction has 168 states and 396 transitions. [2022-07-26 14:21:01,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 396 transitions. [2022-07-26 14:21:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 128. [2022-07-26 14:21:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 2.3984375) internal successors, (307), 127 states have internal predecessors, (307), 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) [2022-07-26 14:21:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 307 transitions. [2022-07-26 14:21:01,285 INFO L242 hiAutomatonCegarLoop]: Abstraction has 128 states and 307 transitions. [2022-07-26 14:21:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-26 14:21:01,289 INFO L426 stractBuchiCegarLoop]: Abstraction has 128 states and 307 transitions. [2022-07-26 14:21:01,289 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-26 14:21:01,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 307 transitions. [2022-07-26 14:21:01,290 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 28 [2022-07-26 14:21:01,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:01,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:01,291 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:21:01,291 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:21:01,292 INFO L733 eck$LassoCheckResult]: Stem: 2702#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2704#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2714#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2716#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2870#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 2866#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 2860#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 2854#[L47-1, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 2710#[L47-1, L97-3]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 2712#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 2726#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 2656#[L52, L97-4, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 2658#[L65-1, L52, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 2790#[L52, L97-4, L70]don't care [2022-07-26 14:21:01,292 INFO L735 eck$LassoCheckResult]: Loop: 2790#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 2786#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 2790#[L52, L97-4, L70]don't care [2022-07-26 14:21:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1712699573, now seen corresponding path program 1 times [2022-07-26 14:21:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785481766] [2022-07-26 14:21:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,317 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:01,354 INFO L85 PathProgramCache]: Analyzing trace with hash 23060, now seen corresponding path program 5 times [2022-07-26 14:21:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:01,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307488469] [2022-07-26 14:21:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:01,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash 931837384, now seen corresponding path program 1 times [2022-07-26 14:21:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:01,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314420802] [2022-07-26 14:21:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:01,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-26 14:21:01,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:21:01,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314420802] [2022-07-26 14:21:01,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314420802] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:21:01,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034800534] [2022-07-26 14:21:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:01,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:21:01,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:01,407 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:21:01,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-07-26 14:21:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:01,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:21:01,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-26 14:21:01,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:21:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-26 14:21:01,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034800534] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:21:01,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:21:01,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-26 14:21:01,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063824211] [2022-07-26 14:21:01,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:21:01,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:21:01,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-26 14:21:01,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-26 14:21:01,697 INFO L87 Difference]: Start difference. First operand 128 states and 307 transitions. cyclomatic complexity: 199 Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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) [2022-07-26 14:21:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:21:01,811 INFO L93 Difference]: Finished difference Result 188 states and 412 transitions. [2022-07-26 14:21:01,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 412 transitions. [2022-07-26 14:21:01,813 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 36 [2022-07-26 14:21:01,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 180 states and 388 transitions. [2022-07-26 14:21:01,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2022-07-26 14:21:01,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2022-07-26 14:21:01,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 388 transitions. [2022-07-26 14:21:01,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:01,816 INFO L220 hiAutomatonCegarLoop]: Abstraction has 180 states and 388 transitions. [2022-07-26 14:21:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 388 transitions. [2022-07-26 14:21:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2022-07-26 14:21:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 2.1823899371069184) internal successors, (347), 158 states have internal predecessors, (347), 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) [2022-07-26 14:21:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 347 transitions. [2022-07-26 14:21:01,832 INFO L242 hiAutomatonCegarLoop]: Abstraction has 159 states and 347 transitions. [2022-07-26 14:21:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-26 14:21:01,835 INFO L426 stractBuchiCegarLoop]: Abstraction has 159 states and 347 transitions. [2022-07-26 14:21:01,835 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-26 14:21:01,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 347 transitions. [2022-07-26 14:21:01,836 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 28 [2022-07-26 14:21:01,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:01,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:01,837 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:21:01,837 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:21:01,837 INFO L733 eck$LassoCheckResult]: Stem: 3251#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3253#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 3263#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 3265#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3429#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 3297#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 3299#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 3303#[L47-1, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 3307#[L47-1, L97-3]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 3447#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 3273#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 3275#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 3455#[L97-4, L47-1, L70]don't care [2022-07-26 14:21:01,838 INFO L735 eck$LassoCheckResult]: Loop: 3455#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 3457#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 3455#[L97-4, L47-1, L70]don't care [2022-07-26 14:21:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1330224937, now seen corresponding path program 2 times [2022-07-26 14:21:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:01,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095415779] [2022-07-26 14:21:01,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:01,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 22073, now seen corresponding path program 6 times [2022-07-26 14:21:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:01,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415835402] [2022-07-26 14:21:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:01,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1554110863, now seen corresponding path program 2 times [2022-07-26 14:21:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:01,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443668390] [2022-07-26 14:21:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:01,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:05,065 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:21:05,065 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:21:05,065 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:21:05,065 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:21:05,065 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:21:05,065 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:05,065 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:21:05,065 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:21:05,065 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-two-queue.wvr.c_BEv2_Iteration13_Lasso [2022-07-26 14:21:05,065 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:21:05,065 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:21:05,068 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,069 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,079 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,085 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,086 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,100 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,101 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,102 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,104 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,105 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,106 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,107 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,108 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,110 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,111 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,113 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,114 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,115 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,116 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,117 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,118 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,120 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,121 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:05,122 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,325 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,326 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,328 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,329 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,331 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,332 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,333 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,336 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,338 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,339 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,340 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,342 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,343 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,345 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,348 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,349 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,354 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,355 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,357 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,358 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,359 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:06,369 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:07,096 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:21:07,096 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:21:07,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,098 INFO L229 MonitoredProcess]: Starting monitored process 87 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) [2022-07-26 14:21:07,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-26 14:21:07,100 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 [2022-07-26 14:21:07,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-07-26 14:21:07,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,121 INFO L229 MonitoredProcess]: Starting monitored process 88 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) [2022-07-26 14:21:07,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-26 14:21:07,124 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 [2022-07-26 14:21:07,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-07-26 14:21:07,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,146 INFO L229 MonitoredProcess]: Starting monitored process 89 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) [2022-07-26 14:21:07,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-26 14:21:07,148 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 [2022-07-26 14:21:07,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:07,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,169 INFO L229 MonitoredProcess]: Starting monitored process 90 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) [2022-07-26 14:21:07,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-26 14:21:07,171 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 [2022-07-26 14:21:07,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-26 14:21:07,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,194 INFO L229 MonitoredProcess]: Starting monitored process 91 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) [2022-07-26 14:21:07,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-26 14:21:07,196 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 [2022-07-26 14:21:07,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:07,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:07,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-26 14:21:07,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,219 INFO L229 MonitoredProcess]: Starting monitored process 92 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) [2022-07-26 14:21:07,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-26 14:21:07,223 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 [2022-07-26 14:21:07,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-26 14:21:07,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,245 INFO L229 MonitoredProcess]: Starting monitored process 93 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) [2022-07-26 14:21:07,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-26 14:21:07,246 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 [2022-07-26 14:21:07,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-26 14:21:07,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,268 INFO L229 MonitoredProcess]: Starting monitored process 94 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) [2022-07-26 14:21:07,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-26 14:21:07,270 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 [2022-07-26 14:21:07,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-26 14:21:07,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,292 INFO L229 MonitoredProcess]: Starting monitored process 95 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) [2022-07-26 14:21:07,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-26 14:21:07,294 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 [2022-07-26 14:21:07,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-07-26 14:21:07,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,316 INFO L229 MonitoredProcess]: Starting monitored process 96 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) [2022-07-26 14:21:07,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-26 14:21:07,318 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 [2022-07-26 14:21:07,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:07,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,343 INFO L229 MonitoredProcess]: Starting monitored process 97 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) [2022-07-26 14:21:07,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-26 14:21:07,345 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 [2022-07-26 14:21:07,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:07,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,367 INFO L229 MonitoredProcess]: Starting monitored process 98 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) [2022-07-26 14:21:07,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-26 14:21:07,368 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 [2022-07-26 14:21:07,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-26 14:21:07,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,398 INFO L229 MonitoredProcess]: Starting monitored process 99 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) [2022-07-26 14:21:07,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-26 14:21:07,399 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 [2022-07-26 14:21:07,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-26 14:21:07,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,421 INFO L229 MonitoredProcess]: Starting monitored process 100 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) [2022-07-26 14:21:07,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-26 14:21:07,422 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 [2022-07-26 14:21:07,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:07,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:07,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-26 14:21:07,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,445 INFO L229 MonitoredProcess]: Starting monitored process 101 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) [2022-07-26 14:21:07,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-26 14:21:07,447 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 [2022-07-26 14:21:07,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-07-26 14:21:07,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,468 INFO L229 MonitoredProcess]: Starting monitored process 102 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) [2022-07-26 14:21:07,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-26 14:21:07,469 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 [2022-07-26 14:21:07,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:07,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,490 INFO L229 MonitoredProcess]: Starting monitored process 103 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) [2022-07-26 14:21:07,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-26 14:21:07,492 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 [2022-07-26 14:21:07,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-07-26 14:21:07,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,513 INFO L229 MonitoredProcess]: Starting monitored process 104 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) [2022-07-26 14:21:07,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-26 14:21:07,515 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 [2022-07-26 14:21:07,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-26 14:21:07,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,546 INFO L229 MonitoredProcess]: Starting monitored process 105 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) [2022-07-26 14:21:07,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-26 14:21:07,548 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 [2022-07-26 14:21:07,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:07,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,569 INFO L229 MonitoredProcess]: Starting monitored process 106 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) [2022-07-26 14:21:07,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-26 14:21:07,571 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 [2022-07-26 14:21:07,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-26 14:21:07,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,593 INFO L229 MonitoredProcess]: Starting monitored process 107 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) [2022-07-26 14:21:07,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-26 14:21:07,594 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 [2022-07-26 14:21:07,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,615 INFO L229 MonitoredProcess]: Starting monitored process 108 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) [2022-07-26 14:21:07,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-26 14:21:07,617 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 [2022-07-26 14:21:07,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:07,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:07,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-07-26 14:21:07,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,645 INFO L229 MonitoredProcess]: Starting monitored process 109 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) [2022-07-26 14:21:07,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-26 14:21:07,646 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 [2022-07-26 14:21:07,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:07,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:07,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:07,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:07,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,668 INFO L229 MonitoredProcess]: Starting monitored process 110 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) [2022-07-26 14:21:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-26 14:21:07,670 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 [2022-07-26 14:21:07,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:07,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:07,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-26 14:21:07,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,707 INFO L229 MonitoredProcess]: Starting monitored process 111 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) [2022-07-26 14:21:07,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-26 14:21:07,709 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 [2022-07-26 14:21:07,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,714 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:21:07,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,719 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:21:07,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:07,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:07,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-26 14:21:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,742 INFO L229 MonitoredProcess]: Starting monitored process 112 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) [2022-07-26 14:21:07,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-26 14:21:07,744 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 [2022-07-26 14:21:07,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:07,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:07,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:07,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:07,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:07,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:07,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:21:07,836 INFO L443 ModelExtractionUtils]: Simplification made 38 calls to the SMT solver. [2022-07-26 14:21:07,836 INFO L444 ModelExtractionUtils]: 8 out of 58 variables were initially zero. Simplification set additionally 47 variables to zero. [2022-07-26 14:21:07,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:07,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:07,837 INFO L229 MonitoredProcess]: Starting monitored process 113 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) [2022-07-26 14:21:07,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-26 14:21:07,839 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:21:07,844 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:21:07,845 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:21:07,845 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n1~0, ~q1_back~0) = 1*~n1~0 - 1*~q1_back~0 Supporting invariants [] [2022-07-26 14:21:07,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-26 14:21:08,057 INFO L156 tatePredicateManager]: 59 out of 59 supporting invariants were superfluous and have been removed [2022-07-26 14:21:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:08,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:21:08,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:08,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:21:08,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:21:08,135 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:21:08,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 347 transitions. cyclomatic complexity: 206 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-26 14:21:08,169 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 347 transitions. cyclomatic complexity: 206. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 296 states and 754 transitions. Complement of second has 4 states. [2022-07-26 14:21:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:21:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-26 14:21:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-07-26 14:21:08,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-26 14:21:08,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:08,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 14 letters. Loop has 2 letters. [2022-07-26 14:21:08,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:08,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-26 14:21:08,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:08,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 754 transitions. [2022-07-26 14:21:08,172 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2022-07-26 14:21:08,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 161 states and 352 transitions. [2022-07-26 14:21:08,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-26 14:21:08,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2022-07-26 14:21:08,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 352 transitions. [2022-07-26 14:21:08,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:08,174 INFO L220 hiAutomatonCegarLoop]: Abstraction has 161 states and 352 transitions. [2022-07-26 14:21:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 352 transitions. [2022-07-26 14:21:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 101. [2022-07-26 14:21:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 2.2475247524752477) internal successors, (227), 100 states have internal predecessors, (227), 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) [2022-07-26 14:21:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 227 transitions. [2022-07-26 14:21:08,176 INFO L242 hiAutomatonCegarLoop]: Abstraction has 101 states and 227 transitions. [2022-07-26 14:21:08,176 INFO L426 stractBuchiCegarLoop]: Abstraction has 101 states and 227 transitions. [2022-07-26 14:21:08,176 INFO L333 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-26 14:21:08,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 227 transitions. [2022-07-26 14:21:08,177 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2022-07-26 14:21:08,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:08,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:08,178 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:21:08,178 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:21:08,178 INFO L733 eck$LassoCheckResult]: Stem: 4107#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4109#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 4133#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 4135#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4293#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 4291#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 4289#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 4285#[L47-1, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 4129#[L47-1, L97-3]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 4131#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 4143#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 4111#[L52, L97-4, L70]don't care [2022-07-26 14:21:08,178 INFO L735 eck$LassoCheckResult]: Loop: 4111#[L52, L97-4, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 4113#[L65-1, L52, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 4111#[L52, L97-4, L70]don't care [2022-07-26 14:21:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1204015485, now seen corresponding path program 1 times [2022-07-26 14:21:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:08,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727341550] [2022-07-26 14:21:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:08,199 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:08,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:08,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:08,220 INFO L85 PathProgramCache]: Analyzing trace with hash 22073, now seen corresponding path program 7 times [2022-07-26 14:21:08,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:08,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263454108] [2022-07-26 14:21:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:08,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:08,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:08,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:08,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:08,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1712699573, now seen corresponding path program 2 times [2022-07-26 14:21:08,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:08,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194996267] [2022-07-26 14:21:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:08,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:08,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:09,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:11,328 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:21:11,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:21:11,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:21:11,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:21:11,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:21:11,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:11,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:21:11,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:21:11,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-two-queue.wvr.c_BEv2_Iteration14_Lasso [2022-07-26 14:21:11,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:21:11,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:21:11,331 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,332 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,334 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,335 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,336 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,337 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,339 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,340 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,341 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,342 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,344 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,345 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,346 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,348 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,349 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,350 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,352 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,353 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,355 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,356 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,368 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,369 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,371 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,372 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,373 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,375 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,377 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,378 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,379 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:11,380 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,561 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,562 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,564 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,566 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,567 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,568 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,570 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,573 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,574 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,576 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,578 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,579 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,582 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,583 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,588 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:12,589 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,266 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:21:13,267 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:21:13,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,268 INFO L229 MonitoredProcess]: Starting monitored process 114 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) [2022-07-26 14:21:13,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:21:13,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-26 14:21:13,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:13,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,299 INFO L229 MonitoredProcess]: Starting monitored process 115 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) [2022-07-26 14:21:13,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-26 14:21:13,301 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 [2022-07-26 14:21:13,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-26 14:21:13,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,323 INFO L229 MonitoredProcess]: Starting monitored process 116 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) [2022-07-26 14:21:13,338 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 [2022-07-26 14:21:13,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-26 14:21:13,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-26 14:21:13,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,360 INFO L229 MonitoredProcess]: Starting monitored process 117 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) [2022-07-26 14:21:13,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-26 14:21:13,361 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 [2022-07-26 14:21:13,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-26 14:21:13,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,384 INFO L229 MonitoredProcess]: Starting monitored process 118 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) [2022-07-26 14:21:13,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-26 14:21:13,386 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 [2022-07-26 14:21:13,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-07-26 14:21:13,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,419 INFO L229 MonitoredProcess]: Starting monitored process 119 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) [2022-07-26 14:21:13,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-26 14:21:13,420 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 [2022-07-26 14:21:13,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-07-26 14:21:13,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,442 INFO L229 MonitoredProcess]: Starting monitored process 120 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) [2022-07-26 14:21:13,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-26 14:21:13,444 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 [2022-07-26 14:21:13,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-26 14:21:13,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,466 INFO L229 MonitoredProcess]: Starting monitored process 121 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) [2022-07-26 14:21:13,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-07-26 14:21:13,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:21:13,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-07-26 14:21:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,499 INFO L229 MonitoredProcess]: Starting monitored process 122 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) [2022-07-26 14:21:13,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-26 14:21:13,500 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 [2022-07-26 14:21:13,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-07-26 14:21:13,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,523 INFO L229 MonitoredProcess]: Starting monitored process 123 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) [2022-07-26 14:21:13,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-26 14:21:13,525 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 [2022-07-26 14:21:13,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:13,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:13,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-07-26 14:21:13,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,549 INFO L229 MonitoredProcess]: Starting monitored process 124 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) [2022-07-26 14:21:13,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-26 14:21:13,553 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 [2022-07-26 14:21:13,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-07-26 14:21:13,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,577 INFO L229 MonitoredProcess]: Starting monitored process 125 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) [2022-07-26 14:21:13,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-26 14:21:13,579 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 [2022-07-26 14:21:13,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-26 14:21:13,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,601 INFO L229 MonitoredProcess]: Starting monitored process 126 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) [2022-07-26 14:21:13,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-26 14:21:13,604 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 [2022-07-26 14:21:13,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:13,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:13,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2022-07-26 14:21:13,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,628 INFO L229 MonitoredProcess]: Starting monitored process 127 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) [2022-07-26 14:21:13,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-26 14:21:13,630 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 [2022-07-26 14:21:13,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2022-07-26 14:21:13,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,652 INFO L229 MonitoredProcess]: Starting monitored process 128 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) [2022-07-26 14:21:13,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-26 14:21:13,661 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 [2022-07-26 14:21:13,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2022-07-26 14:21:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,694 INFO L229 MonitoredProcess]: Starting monitored process 129 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) [2022-07-26 14:21:13,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-26 14:21:13,696 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 [2022-07-26 14:21:13,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:13,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,717 INFO L229 MonitoredProcess]: Starting monitored process 130 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) [2022-07-26 14:21:13,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-26 14:21:13,722 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 [2022-07-26 14:21:13,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:13,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,758 INFO L229 MonitoredProcess]: Starting monitored process 131 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) [2022-07-26 14:21:13,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-26 14:21:13,760 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 [2022-07-26 14:21:13,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:13,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:13,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2022-07-26 14:21:13,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,797 INFO L229 MonitoredProcess]: Starting monitored process 132 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) [2022-07-26 14:21:13,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-26 14:21:13,799 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 [2022-07-26 14:21:13,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-07-26 14:21:13,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,823 INFO L229 MonitoredProcess]: Starting monitored process 133 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) [2022-07-26 14:21:13,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-26 14:21:13,825 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 [2022-07-26 14:21:13,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2022-07-26 14:21:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,847 INFO L229 MonitoredProcess]: Starting monitored process 134 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) [2022-07-26 14:21:13,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-26 14:21:13,848 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 [2022-07-26 14:21:13,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:13,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,875 INFO L229 MonitoredProcess]: Starting monitored process 135 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) [2022-07-26 14:21:13,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-26 14:21:13,877 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 [2022-07-26 14:21:13,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-07-26 14:21:13,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,899 INFO L229 MonitoredProcess]: Starting monitored process 136 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) [2022-07-26 14:21:13,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-26 14:21:13,901 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 [2022-07-26 14:21:13,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-26 14:21:13,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,934 INFO L229 MonitoredProcess]: Starting monitored process 137 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) [2022-07-26 14:21:13,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-26 14:21:13,936 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 [2022-07-26 14:21:13,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-07-26 14:21:13,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,957 INFO L229 MonitoredProcess]: Starting monitored process 138 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) [2022-07-26 14:21:13,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-26 14:21:13,959 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 [2022-07-26 14:21:13,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:13,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:13,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:13,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:13,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-07-26 14:21:13,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:13,982 INFO L229 MonitoredProcess]: Starting monitored process 139 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) [2022-07-26 14:21:13,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-26 14:21:13,984 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 [2022-07-26 14:21:13,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:13,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:13,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:13,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:13,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:13,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-26 14:21:14,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,022 INFO L229 MonitoredProcess]: Starting monitored process 140 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) [2022-07-26 14:21:14,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-26 14:21:14,024 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 [2022-07-26 14:21:14,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:14,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:14,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:14,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2022-07-26 14:21:14,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,045 INFO L229 MonitoredProcess]: Starting monitored process 141 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) [2022-07-26 14:21:14,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-26 14:21:14,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 [2022-07-26 14:21:14,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:14,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:14,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:14,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-07-26 14:21:14,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,069 INFO L229 MonitoredProcess]: Starting monitored process 142 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) [2022-07-26 14:21:14,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-26 14:21:14,071 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 [2022-07-26 14:21:14,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:14,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:14,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:14,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:14,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,092 INFO L229 MonitoredProcess]: Starting monitored process 143 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) [2022-07-26 14:21:14,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-07-26 14:21:14,094 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 [2022-07-26 14:21:14,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:14,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,118 INFO L229 MonitoredProcess]: Starting monitored process 144 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) [2022-07-26 14:21:14,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-07-26 14:21:14,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 [2022-07-26 14:21:14,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-07-26 14:21:14,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,143 INFO L229 MonitoredProcess]: Starting monitored process 145 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) [2022-07-26 14:21:14,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-07-26 14:21:14,145 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 [2022-07-26 14:21:14,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:14,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,168 INFO L229 MonitoredProcess]: Starting monitored process 146 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) [2022-07-26 14:21:14,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-07-26 14:21:14,170 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 [2022-07-26 14:21:14,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2022-07-26 14:21:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,194 INFO L229 MonitoredProcess]: Starting monitored process 147 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) [2022-07-26 14:21:14,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-07-26 14:21:14,196 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 [2022-07-26 14:21:14,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-07-26 14:21:14,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,222 INFO L229 MonitoredProcess]: Starting monitored process 148 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) [2022-07-26 14:21:14,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-07-26 14:21:14,224 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 [2022-07-26 14:21:14,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:14,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,248 INFO L229 MonitoredProcess]: Starting monitored process 149 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) [2022-07-26 14:21:14,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-07-26 14:21:14,250 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 [2022-07-26 14:21:14,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2022-07-26 14:21:14,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,277 INFO L229 MonitoredProcess]: Starting monitored process 150 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) [2022-07-26 14:21:14,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-07-26 14:21:14,279 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 [2022-07-26 14:21:14,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2022-07-26 14:21:14,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,303 INFO L229 MonitoredProcess]: Starting monitored process 151 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) [2022-07-26 14:21:14,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-07-26 14:21:14,305 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 [2022-07-26 14:21:14,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:14,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,329 INFO L229 MonitoredProcess]: Starting monitored process 152 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) [2022-07-26 14:21:14,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-07-26 14:21:14,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:21:14,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,354 INFO L229 MonitoredProcess]: Starting monitored process 153 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) [2022-07-26 14:21:14,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-07-26 14:21:14,356 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 [2022-07-26 14:21:14,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2022-07-26 14:21:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,380 INFO L229 MonitoredProcess]: Starting monitored process 154 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) [2022-07-26 14:21:14,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-07-26 14:21:14,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 [2022-07-26 14:21:14,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2022-07-26 14:21:14,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,406 INFO L229 MonitoredProcess]: Starting monitored process 155 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) [2022-07-26 14:21:14,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-07-26 14:21:14,407 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 [2022-07-26 14:21:14,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2022-07-26 14:21:14,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,431 INFO L229 MonitoredProcess]: Starting monitored process 156 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) [2022-07-26 14:21:14,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-07-26 14:21:14,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:21:14,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:14,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,457 INFO L229 MonitoredProcess]: Starting monitored process 157 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) [2022-07-26 14:21:14,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-07-26 14:21:14,459 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 [2022-07-26 14:21:14,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:14,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2022-07-26 14:21:14,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,482 INFO L229 MonitoredProcess]: Starting monitored process 158 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) [2022-07-26 14:21:14,484 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 [2022-07-26 14:21:14,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:14,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:14,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:14,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:14,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-07-26 14:21:14,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:14,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:14,514 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:21:14,561 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2022-07-26 14:21:14,562 INFO L444 ModelExtractionUtils]: 15 out of 58 variables were initially zero. Simplification set additionally 40 variables to zero. [2022-07-26 14:21:14,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:14,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:14,563 INFO L229 MonitoredProcess]: Starting monitored process 159 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) [2022-07-26 14:21:14,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-07-26 14:21:14,565 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:21:14,592 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:21:14,592 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:21:14,592 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n1~0, ~q1_back~0) = 1*~n1~0 - 1*~q1_back~0 Supporting invariants [] [2022-07-26 14:21:14,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:14,780 INFO L156 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2022-07-26 14:21:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:14,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:21:14,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:14,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:21:14,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:21:14,839 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:21:14,839 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 227 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:21:14,866 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 227 transitions. cyclomatic complexity: 144. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 223 states and 558 transitions. Complement of second has 4 states. [2022-07-26 14:21:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:21:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:21:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-07-26 14:21:14,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:21:14,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:14,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-26 14:21:14,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:14,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-26 14:21:14,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:14,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 558 transitions. [2022-07-26 14:21:14,870 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 14:21:14,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 129 states and 308 transitions. [2022-07-26 14:21:14,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-07-26 14:21:14,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-07-26 14:21:14,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 308 transitions. [2022-07-26 14:21:14,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:14,872 INFO L220 hiAutomatonCegarLoop]: Abstraction has 129 states and 308 transitions. [2022-07-26 14:21:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 308 transitions. [2022-07-26 14:21:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 87. [2022-07-26 14:21:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 2.3908045977011496) internal successors, (208), 86 states have internal predecessors, (208), 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) [2022-07-26 14:21:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 208 transitions. [2022-07-26 14:21:14,874 INFO L242 hiAutomatonCegarLoop]: Abstraction has 87 states and 208 transitions. [2022-07-26 14:21:14,874 INFO L426 stractBuchiCegarLoop]: Abstraction has 87 states and 208 transitions. [2022-07-26 14:21:14,874 INFO L333 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-26 14:21:14,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 208 transitions. [2022-07-26 14:21:14,875 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 14:21:14,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:14,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:14,875 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:21:14,875 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:21:14,876 INFO L733 eck$LassoCheckResult]: Stem: 4811#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4813#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 4833#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 4835#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4865#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 4867#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 4869#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 4861#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 4863#[L47-1, L96-4]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 4871#[L52, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 4877#[L97-3, L52]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 4893#[L65-1, L52, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 4889#[L52, L97-4, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 4817#[L65-1, L52, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 4947#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 4845#[L97-4, L47-1, L70]don't care [2022-07-26 14:21:14,876 INFO L735 eck$LassoCheckResult]: Loop: 4845#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 4849#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 4845#[L97-4, L47-1, L70]don't care [2022-07-26 14:21:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash -478308228, now seen corresponding path program 3 times [2022-07-26 14:21:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:14,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46102791] [2022-07-26 14:21:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:14,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:14,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash 21710, now seen corresponding path program 6 times [2022-07-26 14:21:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:14,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208851594] [2022-07-26 14:21:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:14,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:14,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash -92685687, now seen corresponding path program 4 times [2022-07-26 14:21:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:14,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700740385] [2022-07-26 14:21:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:14,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:15,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:17,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2022-07-26 14:21:20,002 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:21:20,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:21:20,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:21:20,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:21:20,003 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:21:20,003 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:20,003 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:21:20,003 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:21:20,003 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-two-queue.wvr.c_BEv2_Iteration15_Lasso [2022-07-26 14:21:20,003 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:21:20,003 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:21:20,005 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:20,007 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:20,008 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:20,009 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:20,011 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:20,012 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:20,013 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:20,014 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,099 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,101 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,102 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,103 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,105 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,106 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,107 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,108 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,111 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,116 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,117 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,119 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,120 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,121 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,122 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,124 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,125 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,127 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,128 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,129 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,132 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,133 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,134 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,136 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,137 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,139 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,140 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,141 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,142 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,143 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,150 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,151 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,152 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,153 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,155 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,156 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,157 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,158 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:22,886 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:21:22,886 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:21:22,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:22,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:22,887 INFO L229 MonitoredProcess]: Starting monitored process 160 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) [2022-07-26 14:21:22,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-07-26 14:21:22,889 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 [2022-07-26 14:21:22,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:22,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:22,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:22,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:22,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:22,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:22,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:22,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:22,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:22,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:22,937 INFO L229 MonitoredProcess]: Starting monitored process 161 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) [2022-07-26 14:21:22,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-07-26 14:21:22,939 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 [2022-07-26 14:21:22,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:22,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:22,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:22,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:22,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:22,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:22,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:22,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:22,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:22,961 INFO L229 MonitoredProcess]: Starting monitored process 162 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) [2022-07-26 14:21:22,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-07-26 14:21:22,962 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 [2022-07-26 14:21:22,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:22,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:22,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:22,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:22,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:22,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:22,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:22,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:22,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2022-07-26 14:21:22,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:22,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:22,984 INFO L229 MonitoredProcess]: Starting monitored process 163 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) [2022-07-26 14:21:22,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-07-26 14:21:22,986 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 [2022-07-26 14:21:22,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:22,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:22,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:22,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:22,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:22,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:22,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:23,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:23,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,018 INFO L229 MonitoredProcess]: Starting monitored process 164 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) [2022-07-26 14:21:23,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-07-26 14:21:23,020 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 [2022-07-26 14:21:23,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:23,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:23,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:23,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-07-26 14:21:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,056 INFO L229 MonitoredProcess]: Starting monitored process 165 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) [2022-07-26 14:21:23,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-07-26 14:21:23,058 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 [2022-07-26 14:21:23,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:23,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:23,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:23,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:23,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,079 INFO L229 MonitoredProcess]: Starting monitored process 166 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) [2022-07-26 14:21:23,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2022-07-26 14:21:23,081 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 [2022-07-26 14:21:23,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:23,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:23,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:23,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2022-07-26 14:21:23,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,102 INFO L229 MonitoredProcess]: Starting monitored process 167 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) [2022-07-26 14:21:23,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2022-07-26 14:21:23,107 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 [2022-07-26 14:21:23,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:23,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,139 INFO L229 MonitoredProcess]: Starting monitored process 168 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) [2022-07-26 14:21:23,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2022-07-26 14:21:23,140 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 [2022-07-26 14:21:23,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2022-07-26 14:21:23,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,165 INFO L229 MonitoredProcess]: Starting monitored process 169 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) [2022-07-26 14:21:23,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2022-07-26 14:21:23,166 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 [2022-07-26 14:21:23,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2022-07-26 14:21:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,191 INFO L229 MonitoredProcess]: Starting monitored process 170 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) [2022-07-26 14:21:23,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2022-07-26 14:21:23,193 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 [2022-07-26 14:21:23,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2022-07-26 14:21:23,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,231 INFO L229 MonitoredProcess]: Starting monitored process 171 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) [2022-07-26 14:21:23,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2022-07-26 14:21:23,233 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 [2022-07-26 14:21:23,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2022-07-26 14:21:23,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,257 INFO L229 MonitoredProcess]: Starting monitored process 172 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) [2022-07-26 14:21:23,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2022-07-26 14:21:23,259 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 [2022-07-26 14:21:23,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2022-07-26 14:21:23,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,297 INFO L229 MonitoredProcess]: Starting monitored process 173 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) [2022-07-26 14:21:23,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2022-07-26 14:21:23,324 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 [2022-07-26 14:21:23,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:23,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,350 INFO L229 MonitoredProcess]: Starting monitored process 174 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) [2022-07-26 14:21:23,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2022-07-26 14:21:23,352 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 [2022-07-26 14:21:23,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,358 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:21:23,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,363 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:21:23,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:23,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,389 INFO L229 MonitoredProcess]: Starting monitored process 175 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) [2022-07-26 14:21:23,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2022-07-26 14:21:23,390 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 [2022-07-26 14:21:23,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2022-07-26 14:21:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,464 INFO L229 MonitoredProcess]: Starting monitored process 176 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) [2022-07-26 14:21:23,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2022-07-26 14:21:23,466 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 [2022-07-26 14:21:23,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2022-07-26 14:21:23,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,491 INFO L229 MonitoredProcess]: Starting monitored process 177 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) [2022-07-26 14:21:23,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2022-07-26 14:21:23,493 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 [2022-07-26 14:21:23,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2022-07-26 14:21:23,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,526 INFO L229 MonitoredProcess]: Starting monitored process 178 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) [2022-07-26 14:21:23,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2022-07-26 14:21:23,528 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 [2022-07-26 14:21:23,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:23,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,553 INFO L229 MonitoredProcess]: Starting monitored process 179 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) [2022-07-26 14:21:23,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2022-07-26 14:21:23,555 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 [2022-07-26 14:21:23,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:23,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:23,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,580 INFO L229 MonitoredProcess]: Starting monitored process 180 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) [2022-07-26 14:21:23,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2022-07-26 14:21:23,581 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 [2022-07-26 14:21:23,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:23,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:23,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:23,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:23,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:23,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:23,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:21:23,650 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2022-07-26 14:21:23,650 INFO L444 ModelExtractionUtils]: 22 out of 55 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-07-26 14:21:23,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:23,651 INFO L229 MonitoredProcess]: Starting monitored process 181 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) [2022-07-26 14:21:23,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-07-26 14:21:23,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:21:23,658 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:21:23,658 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:21:23,659 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q1_front~0, ~n1~0) = -4*~q1_front~0 + 3*~n1~0 Supporting invariants [] [2022-07-26 14:21:23,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:23,941 INFO L156 tatePredicateManager]: 77 out of 79 supporting invariants were superfluous and have been removed [2022-07-26 14:21:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:23,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-26 14:21:23,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:24,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-26 14:21:24,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:21:24,164 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 1 loop predicates [2022-07-26 14:21:24,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 208 transitions. cyclomatic complexity: 139 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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) [2022-07-26 14:21:24,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 208 transitions. cyclomatic complexity: 139. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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 274 states and 657 transitions. Complement of second has 13 states. [2022-07-26 14:21:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2022-07-26 14:21:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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) [2022-07-26 14:21:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-07-26 14:21:24,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 51 transitions. Stem has 15 letters. Loop has 2 letters. [2022-07-26 14:21:24,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:24,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 51 transitions. Stem has 17 letters. Loop has 2 letters. [2022-07-26 14:21:24,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:24,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 51 transitions. Stem has 15 letters. Loop has 4 letters. [2022-07-26 14:21:24,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:24,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 657 transitions. [2022-07-26 14:21:24,326 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 14:21:24,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 195 states and 452 transitions. [2022-07-26 14:21:24,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2022-07-26 14:21:24,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2022-07-26 14:21:24,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 452 transitions. [2022-07-26 14:21:24,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:24,329 INFO L220 hiAutomatonCegarLoop]: Abstraction has 195 states and 452 transitions. [2022-07-26 14:21:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 452 transitions. [2022-07-26 14:21:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 113. [2022-07-26 14:21:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 2.256637168141593) internal successors, (255), 112 states have internal predecessors, (255), 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) [2022-07-26 14:21:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 255 transitions. [2022-07-26 14:21:24,331 INFO L242 hiAutomatonCegarLoop]: Abstraction has 113 states and 255 transitions. [2022-07-26 14:21:24,331 INFO L426 stractBuchiCegarLoop]: Abstraction has 113 states and 255 transitions. [2022-07-26 14:21:24,331 INFO L333 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-26 14:21:24,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 255 transitions. [2022-07-26 14:21:24,332 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 14:21:24,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:24,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:24,332 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:21:24,332 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:21:24,333 INFO L733 eck$LassoCheckResult]: Stem: 5674#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5676#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 5696#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 5698#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5732#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 5734#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 5780#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 5782#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 5740#[L47-1, L96-4]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 5742#[L52, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 5748#[L97-3, L52]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 5872#[L65-1, L52, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 5868#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 5860#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 5850#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 5752#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 5794#[L65-1, L97-4, L47-1]don't care [2022-07-26 14:21:24,333 INFO L735 eck$LassoCheckResult]: Loop: 5794#[L65-1, L97-4, L47-1]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 5792#[L65-1, L52, L97-4]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 5794#[L65-1, L97-4, L47-1]don't care [2022-07-26 14:21:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1941692760, now seen corresponding path program 5 times [2022-07-26 14:21:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:24,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102576461] [2022-07-26 14:21:24,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-26 14:21:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:21:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102576461] [2022-07-26 14:21:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102576461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:21:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510572216] [2022-07-26 14:21:24,381 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-26 14:21:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:21:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:24,382 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:21:24,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2022-07-26 14:21:24,476 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-26 14:21:24,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-26 14:21:24,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:21:24,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-26 14:21:24,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-26 14:21:24,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510572216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:21:24,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-26 14:21:24,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-07-26 14:21:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767562047] [2022-07-26 14:21:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:21:24,496 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:21:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash 21710, now seen corresponding path program 7 times [2022-07-26 14:21:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:24,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768146939] [2022-07-26 14:21:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:24,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:24,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:21:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:21:24,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-26 14:21:24,601 INFO L87 Difference]: Start difference. First operand 113 states and 255 transitions. cyclomatic complexity: 161 Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:21:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:21:24,628 INFO L93 Difference]: Finished difference Result 219 states and 513 transitions. [2022-07-26 14:21:24,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 513 transitions. [2022-07-26 14:21:24,630 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 14:21:24,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 513 transitions. [2022-07-26 14:21:24,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2022-07-26 14:21:24,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2022-07-26 14:21:24,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 513 transitions. [2022-07-26 14:21:24,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:24,632 INFO L220 hiAutomatonCegarLoop]: Abstraction has 219 states and 513 transitions. [2022-07-26 14:21:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 513 transitions. [2022-07-26 14:21:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2022-07-26 14:21:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 197 states have (on average 2.3807106598984773) internal successors, (469), 196 states have internal predecessors, (469), 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) [2022-07-26 14:21:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 469 transitions. [2022-07-26 14:21:24,636 INFO L242 hiAutomatonCegarLoop]: Abstraction has 197 states and 469 transitions. [2022-07-26 14:21:24,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:21:24,636 INFO L426 stractBuchiCegarLoop]: Abstraction has 197 states and 469 transitions. [2022-07-26 14:21:24,636 INFO L333 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-26 14:21:24,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 469 transitions. [2022-07-26 14:21:24,637 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 14:21:24,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:24,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:24,638 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:21:24,638 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:21:24,640 INFO L733 eck$LassoCheckResult]: Stem: 6173#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6175#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 6199#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 6201#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6291#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 6243#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 6245#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 6235#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 6237#[L47-1, L96-4]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 6257#[L52, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 6259#[L97-3, L52]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 6285#[L65-1, L52, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 6273#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 6485#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 6489#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 6345#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 6329#[L52, L97-4, L70]don't care [2022-07-26 14:21:24,640 INFO L735 eck$LassoCheckResult]: Loop: 6329#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 6323#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 6329#[L52, L97-4, L70]don't care [2022-07-26 14:21:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1941692773, now seen corresponding path program 6 times [2022-07-26 14:21:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:24,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228811618] [2022-07-26 14:21:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:24,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:24,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:24,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash 23060, now seen corresponding path program 8 times [2022-07-26 14:21:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:24,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84019034] [2022-07-26 14:21:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:24,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:24,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1950926290, now seen corresponding path program 7 times [2022-07-26 14:21:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:24,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025611754] [2022-07-26 14:21:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:24,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-26 14:21:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:21:24,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025611754] [2022-07-26 14:21:24,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025611754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:21:24,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700800479] [2022-07-26 14:21:24,811 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-26 14:21:24,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:21:24,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:24,812 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:21:24,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Waiting until timeout for monitored process [2022-07-26 14:21:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:24,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-26 14:21:24,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-26 14:21:24,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:21:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-26 14:21:25,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700800479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:21:25,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:21:25,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-07-26 14:21:25,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567512256] [2022-07-26 14:21:25,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:21:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:21:25,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-26 14:21:25,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-07-26 14:21:25,186 INFO L87 Difference]: Start difference. First operand 197 states and 469 transitions. cyclomatic complexity: 293 Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 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) [2022-07-26 14:21:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:21:25,310 INFO L93 Difference]: Finished difference Result 404 states and 880 transitions. [2022-07-26 14:21:25,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 880 transitions. [2022-07-26 14:21:25,313 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 14:21:25,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 199 states and 471 transitions. [2022-07-26 14:21:25,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-26 14:21:25,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-26 14:21:25,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 471 transitions. [2022-07-26 14:21:25,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:25,314 INFO L220 hiAutomatonCegarLoop]: Abstraction has 199 states and 471 transitions. [2022-07-26 14:21:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 471 transitions. [2022-07-26 14:21:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-07-26 14:21:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 2.3668341708542715) internal successors, (471), 198 states have internal predecessors, (471), 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) [2022-07-26 14:21:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 471 transitions. [2022-07-26 14:21:25,318 INFO L242 hiAutomatonCegarLoop]: Abstraction has 199 states and 471 transitions. [2022-07-26 14:21:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-26 14:21:25,318 INFO L426 stractBuchiCegarLoop]: Abstraction has 199 states and 471 transitions. [2022-07-26 14:21:25,318 INFO L333 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-26 14:21:25,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 471 transitions. [2022-07-26 14:21:25,319 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 14:21:25,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:25,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:25,320 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:21:25,320 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:21:25,320 INFO L733 eck$LassoCheckResult]: Stem: 7102#[ULTIMATE.startENTRY]don't care [759] ULTIMATE.startENTRY-->L112-6: Formula: (let ((.cse2 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_14|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= 0 |v_#NULL.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (< |v_#StackHeapBarrier_In_5| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~q1~0.base_Out_2 0) (= (select |v_#valid_In_5| 2) 1) (= v_~q2_front~0_Out_2 v_~q2_back~0_Out_2) (= v_~q1_front~0_Out_2 v_~q1_back~0_Out_2) (= |v_#NULL.offset_Out_2| 0) (= |v_#length_Out_10| (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~q2~0.base_Out_2 0) (= v_~q2~0.offset_Out_2 0) (= v_~n1~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_5| 1)) (= 23 (select |v_#length_In_5| 2)) (< 0 |v_#StackHeapBarrier_In_5|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= v_~j~0_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= v_~i~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= (select |v_#valid_In_5| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= v_~q1~0.offset_Out_2 0)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ~q1_back~0=v_~q1_back~0_Out_2, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_10|, ~q2~0.base=v_~q2~0.base_Out_2, ~q1~0.offset=v_~q1~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~i~0=v_~i~0_Out_2, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_Out_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ~j~0=v_~j~0_Out_2, ~q1_front~0=v_~q1_front~0_Out_2, ~n1~0=v_~n1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_10|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ~q1~0.base=v_~q1~0.base_Out_2, ~q2_back~0=v_~q2_back~0_Out_2, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_Out_2|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ~n2~0=v_~n2~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #valid=|v_#valid_Out_14|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_Out_10|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #NULL.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q1_back~0, ULTIMATE.start_main_#t~nondet13#1, #length, ~q2~0.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ULTIMATE.start_main_#t~mem23#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_main_#t~pre18#1, ~j~0, ~q1_front~0, ~n1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1~0.base, ~q2_back~0, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~ret16#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_main_#t~ret17#1.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, #valid, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7104#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 7128#[L112-6]don't care [714] L112-6-->L112-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_77|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|)) |v_#memory_int_115|) (<= 0 .cse1) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_32|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_77|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 7130#[L112-6]don't care [752] L112-6-->L112-14: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94| v_~q1~0.base_51) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|) (= v_~q1~0.offset_51 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| |v_#StackHeapBarrier_58|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| 1) |v_#valid_250|) (= (store |v_#length_214| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_213|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_145| 0)) (= (select |v_#valid_251| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_116|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~n2~0_62)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_94|, #valid=|v_#valid_251|, #length=|v_#length_214|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_116|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_93|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ~q1~0.offset=v_~q1~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|, ~n2~0=v_~n2~0_62, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_53|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_53|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_145|, #valid=|v_#valid_250|, ~q1~0.base=v_~q1~0.base_51, #length=|v_#length_213|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret16#1.base, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~q1~0.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7168#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 7170#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 7172#[L112-14]don't care [715] L112-14-->L112-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_79|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 4) (select |v_#length_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (store (select |v_#memory_int_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|)) |v_#memory_int_119|) (= (select |v_#valid_166| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_36|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_70|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_create_fresh_int_array_#t~post25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post25#1_37|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_69|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_79|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~post25#1, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, ULTIMATE.start_create_fresh_int_array_~i~1#1] 7372#[L112-14]don't care [739] L112-14-->L96-3: Formula: (and (= v_~q2~0.offset_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_183| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= v_~q2~0.base_39 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|) (= |v_ULTIMATE.start_main_#t~pre18#1_27| |v_#pthreadsForks_34|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre18#1_27|)) |v_#memory_int_127|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|) (= (select |v_#valid_216| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_128|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_75|, ~q2~0.offset=v_~q2~0.offset_39, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_25|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_91|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_216|, #memory_int=|v_#memory_int_127|, #length=|v_#length_183|, ~q2~0.base=v_~q2~0.base_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 7164#[L96-3]don't care [572] L96-3-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 7166#[L47-1, L96-4]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 7174#[L52, L96-4]don't care [711] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_19|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre20#1_19|))) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_112|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_23|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_111|, #length=|v_#length_133|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 7204#[L97-3, L52]don't care [575] L97-3-->L65-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_8|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_thidvar1] 7202#[L65-1, L52, L97-4]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 7198#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 7428#[L97-4, L47-1, L70]don't care [660] L70-->L65-1: Formula: (let ((.cse1 (* 4 v_~q2_front~0_45))) (let ((.cse0 (+ v_~q2~0.offset_31 .cse1))) (and (= (+ v_~q2_front~0_45 1) v_~q2_front~0_44) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (ite (and (< v_~q2_front~0_45 v_~q2_back~0_58) (<= 0 v_~q2_front~0_45) (< v_~q2_front~0_45 v_~n2~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_112| v_~q2~0.base_31) 1) (<= 0 .cse0) (= v_~j~0_41 (+ (select (select |v_#memory_int_87| v_~q2~0.base_31) .cse0) 1)) (<= (+ v_~q2~0.offset_31 .cse1 4) (select |v_#length_97| v_~q2~0.base_31))))) InVars {~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2_front~0=v_~q2_front~0_45, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} OutVars{~j~0=v_~j~0_41, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_15|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_7|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~q2_front~0=v_~q2_front~0_44, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_87|, ~q2~0.base=v_~q2~0.base_31, #length=|v_#length_97|, ~q2_back~0=v_~q2_back~0_58} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] 7262#[L65-1, L97-4, L47-1]don't care [652] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_back~0_67))) (let ((.cse0 (+ v_~q1~0.offset_37 .cse1))) (and (< v_~j~0_39 v_~N~0_15) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (select |v_#valid_110| v_~q1~0.base_37) 1) (= (ite (= v_~j~0_39 (select (select |v_#memory_int_85| v_~q1~0.base_37) .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (<= (+ v_~q1~0.offset_37 .cse1 4) (select |v_#length_95| v_~q1~0.base_37)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (not (= (ite (and (< v_~q1_back~0_67 v_~n1~0_30) (<= 0 v_~q1_back~0_67)) 1 0) 0))))) InVars {~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|, ~N~0=v_~N~0_15} OutVars{~j~0=v_~j~0_39, ~q1~0.offset=v_~q1~0.offset_37, ~n1~0=v_~n1~0_30, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~N~0=v_~N~0_15, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1_back~0=v_~q1_back~0_66, ~q1~0.base=v_~q1~0.base_37, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_85|, #length=|v_#length_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] 7246#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 7222#[L52, L97-4, L70]don't care [2022-07-26 14:21:25,321 INFO L735 eck$LassoCheckResult]: Loop: 7222#[L52, L97-4, L70]don't care [692] L52-->L47-1: Formula: (let ((.cse1 (* 4 v_~q1_front~0_53))) (let ((.cse0 (+ v_~q1~0.offset_41 .cse1))) (and (= (select |v_#valid_134| v_~q1~0.base_41) 1) (= (ite (and (< v_~q1_front~0_53 v_~n1~0_38) (< v_~q1_front~0_53 v_~q1_back~0_74) (<= 0 v_~q1_front~0_53)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~i~0_49 (+ (select (select |v_#memory_int_101| v_~q1~0.base_41) .cse0) 1)) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (<= (+ v_~q1~0.offset_41 .cse1 4) (select |v_#length_119| v_~q1~0.base_41)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_38, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_101|, #length=|v_#length_119|} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_52, ~i~0=v_~i~0_49, ~n1~0=v_~n1~0_38, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q1_back~0=v_~q1_back~0_74, ~q1~0.base=v_~q1~0.base_41, #valid=|v_#valid_134|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #length=|v_#length_119|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] 7224#[L97-4, L47-1, L70]don't care [647] L47-1-->L52: Formula: (let ((.cse0 (* v_~q2_back~0_53 4))) (let ((.cse1 (+ v_~q2~0.offset_29 .cse0))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~q2_back~0_52 (+ v_~q2_back~0_53 1)) (<= (+ v_~q2~0.offset_29 .cse0 4) (select |v_#length_91| v_~q2~0.base_29)) (not (= (ite (and (<= 0 v_~q2_back~0_53) (< v_~q2_back~0_53 v_~n2~0_34)) 1 0) 0)) (< v_~i~0_39 v_~N~0_13) (= (ite (= v_~i~0_39 (select (select |v_#memory_int_81| v_~q2~0.base_29) .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (<= 0 .cse1) (= (select |v_#valid_106| v_~q2~0.base_29) 1)))) InVars {~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, ~N~0=v_~N~0_13, ~q2_back~0=v_~q2_back~0_53} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, ~n2~0=v_~n2~0_34, ~i~0=v_~i~0_39, ~q2~0.offset=v_~q2~0.offset_29, ~N~0=v_~N~0_13, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_81|, ~q2~0.base=v_~q2~0.base_29, #length=|v_#length_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] 7222#[L52, L97-4, L70]don't care [2022-07-26 14:21:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1893378958, now seen corresponding path program 8 times [2022-07-26 14:21:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:25,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101378861] [2022-07-26 14:21:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:25,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:25,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash 23060, now seen corresponding path program 9 times [2022-07-26 14:21:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:25,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362099899] [2022-07-26 14:21:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:25,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:25,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:25,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1528976965, now seen corresponding path program 9 times [2022-07-26 14:21:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:25,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687217773] [2022-07-26 14:21:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:25,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:25,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:30,729 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 429 DAG size of output: 340 (called from [L 277] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-26 14:21:32,144 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:21:32,144 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:21:32,144 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:21:32,144 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:21:32,144 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:21:32,144 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:32,144 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:21:32,144 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:21:32,144 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-two-queue.wvr.c_BEv2_Iteration18_Lasso [2022-07-26 14:21:32,144 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:21:32,144 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:21:32,147 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:32,156 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:32,157 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:32,158 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:32,160 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:32,163 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:32,164 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,452 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,454 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,456 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,457 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,459 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,460 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,461 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,462 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,463 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,465 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,466 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,468 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,469 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,471 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,472 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,473 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,474 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,475 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,477 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,478 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,479 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,480 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,484 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,485 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,486 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,487 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,488 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,490 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,492 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,493 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,494 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,495 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,497 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,498 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,499 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,501 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,502 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,503 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:34,505 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:35,321 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:21:35,321 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:21:35,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,322 INFO L229 MonitoredProcess]: Starting monitored process 184 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) [2022-07-26 14:21:35,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-07-26 14:21:35,327 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 [2022-07-26 14:21:35,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:35,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:35,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:35,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2022-07-26 14:21:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,349 INFO L229 MonitoredProcess]: Starting monitored process 185 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) [2022-07-26 14:21:35,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2022-07-26 14:21:35,351 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 [2022-07-26 14:21:35,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:35,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:35,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:35,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:35,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,377 INFO L229 MonitoredProcess]: Starting monitored process 186 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) [2022-07-26 14:21:35,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2022-07-26 14:21:35,379 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 [2022-07-26 14:21:35,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:35,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:35,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:35,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2022-07-26 14:21:35,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,401 INFO L229 MonitoredProcess]: Starting monitored process 187 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) [2022-07-26 14:21:35,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2022-07-26 14:21:35,402 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 [2022-07-26 14:21:35,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:35,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:35,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:35,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2022-07-26 14:21:35,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,424 INFO L229 MonitoredProcess]: Starting monitored process 188 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) [2022-07-26 14:21:35,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2022-07-26 14:21:35,427 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 [2022-07-26 14:21:35,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2022-07-26 14:21:35,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,451 INFO L229 MonitoredProcess]: Starting monitored process 189 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) [2022-07-26 14:21:35,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2022-07-26 14:21:35,453 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 [2022-07-26 14:21:35,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:35,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:35,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:35,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:35,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,475 INFO L229 MonitoredProcess]: Starting monitored process 190 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) [2022-07-26 14:21:35,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2022-07-26 14:21:35,477 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 [2022-07-26 14:21:35,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:35,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,501 INFO L229 MonitoredProcess]: Starting monitored process 191 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) [2022-07-26 14:21:35,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2022-07-26 14:21:35,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 [2022-07-26 14:21:35,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2022-07-26 14:21:35,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,526 INFO L229 MonitoredProcess]: Starting monitored process 192 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) [2022-07-26 14:21:35,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2022-07-26 14:21:35,529 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 [2022-07-26 14:21:35,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2022-07-26 14:21:35,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,552 INFO L229 MonitoredProcess]: Starting monitored process 193 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) [2022-07-26 14:21:35,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2022-07-26 14:21:35,554 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 [2022-07-26 14:21:35,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2022-07-26 14:21:35,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,578 INFO L229 MonitoredProcess]: Starting monitored process 194 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) [2022-07-26 14:21:35,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2022-07-26 14:21:35,580 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 [2022-07-26 14:21:35,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2022-07-26 14:21:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,604 INFO L229 MonitoredProcess]: Starting monitored process 195 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) [2022-07-26 14:21:35,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2022-07-26 14:21:35,606 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 [2022-07-26 14:21:35,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,611 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:21:35,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,615 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:21:35,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2022-07-26 14:21:35,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,640 INFO L229 MonitoredProcess]: Starting monitored process 196 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) [2022-07-26 14:21:35,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2022-07-26 14:21:35,642 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 [2022-07-26 14:21:35,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2022-07-26 14:21:35,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,681 INFO L229 MonitoredProcess]: Starting monitored process 197 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) [2022-07-26 14:21:35,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2022-07-26 14:21:35,683 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 [2022-07-26 14:21:35,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2022-07-26 14:21:35,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,708 INFO L229 MonitoredProcess]: Starting monitored process 198 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) [2022-07-26 14:21:35,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2022-07-26 14:21:35,709 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 [2022-07-26 14:21:35,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2022-07-26 14:21:35,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,743 INFO L229 MonitoredProcess]: Starting monitored process 199 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) [2022-07-26 14:21:35,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2022-07-26 14:21:35,745 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 [2022-07-26 14:21:35,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2022-07-26 14:21:35,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,769 INFO L229 MonitoredProcess]: Starting monitored process 200 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) [2022-07-26 14:21:35,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2022-07-26 14:21:35,771 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 [2022-07-26 14:21:35,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:35,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2022-07-26 14:21:35,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,799 INFO L229 MonitoredProcess]: Starting monitored process 201 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) [2022-07-26 14:21:35,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2022-07-26 14:21:35,801 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 [2022-07-26 14:21:35,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:35,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:35,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:35,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:35,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:35,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:35,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:21:35,856 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-26 14:21:35,857 INFO L444 ModelExtractionUtils]: 19 out of 58 variables were initially zero. Simplification set additionally 36 variables to zero. [2022-07-26 14:21:35,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:35,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:35,858 INFO L229 MonitoredProcess]: Starting monitored process 202 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) [2022-07-26 14:21:35,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2022-07-26 14:21:35,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:21:35,865 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:21:35,865 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:21:35,865 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q1_front~0, ~n1~0) = -1*~q1_front~0 + 1*~n1~0 Supporting invariants [] [2022-07-26 14:21:35,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:36,192 INFO L156 tatePredicateManager]: 87 out of 87 supporting invariants were superfluous and have been removed [2022-07-26 14:21:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:36,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:21:36,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:36,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:21:36,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:21:36,292 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-26 14:21:36,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 199 states and 471 transitions. cyclomatic complexity: 293 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-07-26 14:21:36,327 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 199 states and 471 transitions. cyclomatic complexity: 293. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 403 states and 1001 transitions. Complement of second has 4 states. [2022-07-26 14:21:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:21:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-07-26 14:21:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-07-26 14:21:36,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 17 letters. Loop has 2 letters. [2022-07-26 14:21:36,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:36,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 19 letters. Loop has 2 letters. [2022-07-26 14:21:36,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:36,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 17 letters. Loop has 4 letters. [2022-07-26 14:21:36,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:36,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 403 states and 1001 transitions. [2022-07-26 14:21:36,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:21:36,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 403 states to 0 states and 0 transitions. [2022-07-26 14:21:36,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 14:21:36,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 14:21:36,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 14:21:36,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:21:36,331 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:21:36,331 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:21:36,331 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:21:36,332 INFO L333 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-26 14:21:36,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 14:21:36,332 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:21:36,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 14:21:36,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:21:36 BoogieIcfgContainer [2022-07-26 14:21:36,336 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:21:36,336 INFO L158 Benchmark]: Toolchain (without parser) took 116935.37ms. Allocated memory was 203.4MB in the beginning and 610.3MB in the end (delta: 406.8MB). Free memory was 151.6MB in the beginning and 352.0MB in the end (delta: -200.4MB). Peak memory consumption was 208.0MB. Max. memory is 8.0GB. [2022-07-26 14:21:36,336 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:21:36,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.07ms. Allocated memory is still 203.4MB. Free memory was 151.4MB in the beginning and 177.3MB in the end (delta: -25.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-07-26 14:21:36,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.49ms. Allocated memory is still 203.4MB. Free memory was 177.3MB in the beginning and 175.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:21:36,337 INFO L158 Benchmark]: Boogie Preprocessor took 20.64ms. Allocated memory is still 203.4MB. Free memory was 175.2MB in the beginning and 173.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:21:36,337 INFO L158 Benchmark]: RCFGBuilder took 478.10ms. Allocated memory is still 203.4MB. Free memory was 173.5MB in the beginning and 147.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-07-26 14:21:36,337 INFO L158 Benchmark]: BuchiAutomizer took 116187.59ms. Allocated memory was 203.4MB in the beginning and 610.3MB in the end (delta: 406.8MB). Free memory was 147.2MB in the beginning and 352.0MB in the end (delta: -204.8MB). Peak memory consumption was 203.0MB. Max. memory is 8.0GB. [2022-07-26 14:21:36,338 INFO L339 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 203.4MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.07ms. Allocated memory is still 203.4MB. Free memory was 151.4MB in the beginning and 177.3MB in the end (delta: -25.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.49ms. Allocated memory is still 203.4MB. Free memory was 177.3MB in the beginning and 175.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.64ms. Allocated memory is still 203.4MB. Free memory was 175.2MB in the beginning and 173.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 478.10ms. Allocated memory is still 203.4MB. Free memory was 173.5MB in the beginning and 147.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 116187.59ms. Allocated memory was 203.4MB in the beginning and 610.3MB in the end (delta: 406.8MB). Free memory was 147.2MB in the beginning and 352.0MB in the end (delta: -204.8MB). Peak memory consumption was 203.0MB. 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 18 terminating modules (11 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 2 locations. One deterministic module has affine ranking function size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function q1_back + -1 * q1_front and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_back + n1 and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_back + n1 and consists of 3 locations. One deterministic module has affine ranking function -4 * q1_front + 3 * n1 and consists of 11 locations. One deterministic module has affine ranking function -1 * q1_front + n1 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 116.0s and 19 iterations. TraceHistogramMax:3. Analysis of lassos took 83.2s. Construction of modules took 1.0s. Büchi inclusion checks took 27.1s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 306 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 403 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 397 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 360 IncrementalHoareTripleChecker+Unchecked, 539 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1758 IncrementalHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 0 mSDtfsCounter, 1758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc7 concLT0 SILN0 SILU4 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital518 mio100 ax105 hnf100 lsp85 ukn64 mio100 lsp45 div120 bol100 ite100 ukn100 eq169 hnf92 smp85 dnf101 smp98 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 7 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 4.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 162 PlacesBefore, 22 PlacesAfterwards, 168 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 8 FixpointIterations, 123 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 29 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 182 TotalNumberOfCompositions, 820 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 676, positive: 634, positive conditional: 0, positive unconditional: 634, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 272, positive: 261, positive conditional: 0, positive unconditional: 261, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 676, positive: 373, positive conditional: 0, positive unconditional: 373, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 272, unknown conditional: 0, unknown unconditional: 272] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 RESULT: Ultimate proved your program to be correct! [2022-07-26 14:21:36,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:36,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:36,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Forceful destruction successful, exit code 0 [2022-07-26 14:21:36,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2022-07-26 14:21:37,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-07-26 14:21:37,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-07-26 14:21:37,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...