/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-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:17:05,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:17:05,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:17:05,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:17:05,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:17:05,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:17:05,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:17:05,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:17:05,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:17:05,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:17:05,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:17:05,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:17:05,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:17:05,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:17:05,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:17:05,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:17:05,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:17:05,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:17:05,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:17:05,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:17:05,824 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:17:05,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:17:05,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:17:05,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:17:05,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:17:05,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:17:05,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:17:05,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:17:05,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:17:05,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:17:05,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:17:05,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:17:05,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:17:05,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:17:05,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:17:05,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:17:05,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:17:05,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:17:05,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:17:05,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:17:05,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:17:05,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:17:05,840 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:17:05,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:17:05,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:17:05,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:17:05,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:17:05,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:17:05,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:17:05,865 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:17:05,865 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:17:05,865 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:17:05,866 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:17:05,866 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:17:05,866 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:17:05,866 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:17:05,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:17:05,867 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:17:05,867 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:17:05,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:17:05,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:17:05,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:17:05,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:17:05,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:17:05,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:17:05,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:17:05,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:17:05,868 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:17:05,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:17:05,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:17:05,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:17:05,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:17:05,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:17:05,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:17:05,869 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:17:05,869 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:17:05,869 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:17:06,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:17:06,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:17:06,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:17:06,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:17:06,085 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:17:06,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-07-26 14:17:06,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7466e8949/2604aed85c0747d99f47b779126a4955/FLAG1e17c03bc [2022-07-26 14:17:06,525 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:17:06,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-07-26 14:17:06,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7466e8949/2604aed85c0747d99f47b779126a4955/FLAG1e17c03bc [2022-07-26 14:17:06,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7466e8949/2604aed85c0747d99f47b779126a4955 [2022-07-26 14:17:06,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:17:06,544 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:17:06,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:17:06,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:17:06,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:17:06,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c422c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06, skipping insertion in model container [2022-07-26 14:17:06,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:17:06,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:17:06,735 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-more-inc-subseq.wvr.c[2924,2937] [2022-07-26 14:17:06,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:17:06,751 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:17:06,777 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-more-inc-subseq.wvr.c[2924,2937] [2022-07-26 14:17:06,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:17:06,803 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:17:06,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06 WrapperNode [2022-07-26 14:17:06,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:17:06,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:17:06,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:17:06,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:17:06,809 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:17:06" (1/1) ... [2022-07-26 14:17:06,823 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:17:06" (1/1) ... [2022-07-26 14:17:06,847 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 186 [2022-07-26 14:17:06,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:17:06,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:17:06,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:17:06,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:17:06,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:17:06,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:17:06,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:17:06,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:17:06,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (1/1) ... [2022-07-26 14:17:06,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:06,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:06,907 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:17:06,913 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:17:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:17:06,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:17:06,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:17:06,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:17:06,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:17:06,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:17:06,944 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:17:07,054 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:17:07,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:17:07,349 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:17:07,406 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:17:07,407 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-26 14:17:07,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:17:07 BoogieIcfgContainer [2022-07-26 14:17:07,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:17:07,409 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:17:07,409 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:17:07,412 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:17:07,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:17:07,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:17:06" (1/3) ... [2022-07-26 14:17:07,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cca521a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:17:07, skipping insertion in model container [2022-07-26 14:17:07,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:17:07,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:06" (2/3) ... [2022-07-26 14:17:07,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cca521a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:17:07, skipping insertion in model container [2022-07-26 14:17:07,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:17:07,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:17:07" (3/3) ... [2022-07-26 14:17:07,414 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-07-26 14:17:07,468 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:17:07,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 185 transitions, 386 flow [2022-07-26 14:17:07,530 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-26 14:17:07,530 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:17:07,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 15/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2022-07-26 14:17:07,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 185 transitions, 386 flow [2022-07-26 14:17:07,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 374 flow [2022-07-26 14:17:07,539 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:17:07,544 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-26 14:17:07,546 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-26 14:17:07,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 374 flow [2022-07-26 14:17:07,579 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-26 14:17:07,579 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:17:07,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 15/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2022-07-26 14:17:07,580 INFO L116 LiptonReduction]: Number of co-enabled transitions 690 [2022-07-26 14:17:11,571 INFO L131 LiptonReduction]: Checked pairs total: 1324 [2022-07-26 14:17:11,572 INFO L133 LiptonReduction]: Total number of compositions: 194 [2022-07-26 14:17:11,593 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:17:11,593 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:17:11,593 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:17:11,607 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:17:11,607 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:17:11,607 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:17:11,608 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:17:11,608 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:17:11,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:17:11,663 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-07-26 14:17:11,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:11,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:11,672 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:17:11,672 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:17:11,672 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:17:11,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 73 states, but on-demand construction may add more states [2022-07-26 14:17:11,681 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-07-26 14:17:11,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:11,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:11,682 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:17:11,682 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:17:11,685 INFO L733 eck$LassoCheckResult]: Stem: 178#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 181#[L117-6]don't care [2022-07-26 14:17:11,687 INFO L735 eck$LassoCheckResult]: Loop: 181#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 181#[L117-6]don't care [2022-07-26 14:17:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 772, now seen corresponding path program 1 times [2022-07-26 14:17:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:11,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579936289] [2022-07-26 14:17:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:11,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:11,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:11,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash 734, now seen corresponding path program 1 times [2022-07-26 14:17:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:11,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451539083] [2022-07-26 14:17:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:11,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:11,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:11,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash 24635, now seen corresponding path program 1 times [2022-07-26 14:17:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:11,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86067653] [2022-07-26 14:17:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:11,853 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:11,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:12,461 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:12,461 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:12,461 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:12,461 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:12,462 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:12,462 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,462 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:12,462 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:12,462 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:17:12,462 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:12,462 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:12,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:17:12,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:17:12,500 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,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:17:12,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:17:12,508 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,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:17:12,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:17:12,715 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,717 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,718 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,720 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,721 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,722 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,724 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,726 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,728 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,729 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,730 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,734 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,735 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,737 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,739 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,741 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,743 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,744 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,746 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,747 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,749 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,751 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,752 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,754 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,755 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,757 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,758 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,760 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,761 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,763 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,765 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,766 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:12,768 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:13,145 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:13,148 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:13,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,183 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:17:13,227 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:17:13,228 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:17:13,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:13,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:13,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,282 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:17:13,286 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:17:13,287 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:17:13,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:13,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:13,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:13,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,315 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:17:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,317 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:17:13,320 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:17:13,320 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:17:13,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:13,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:13,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:13,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,354 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:17:13,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,355 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:17:13,357 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:17:13,358 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:17:13,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:13,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,408 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:17:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,410 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:17:13,436 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:17:13,436 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:17:13,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:13,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:13,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:13,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,476 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:17:13,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,481 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:17:13,483 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:17:13,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:17:13,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:13,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,531 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:17:13,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,542 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:17:13,543 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:17:13,545 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:17:13,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,551 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 14:17:13,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,555 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 14:17:13,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,579 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:17:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,584 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:17:13,584 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:17:13,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:17:13,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:13,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,644 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:17:13,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,660 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:17:13,664 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:17:13,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:13,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,687 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:17:13,694 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:17:13,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,695 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:17:13,696 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:17:13,697 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:17:13,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:13,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-26 14:17:13,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,727 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:17:13,728 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:17:13,729 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:17:13,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:13,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,795 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:17:13,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,805 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:17:13,807 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:17:13,807 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:17:13,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:13,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:13,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:13,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:13,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:13,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,832 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:17:13,833 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:17:13,834 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:17:13,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:13,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:13,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:13,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:13,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:13,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:13,862 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:13,921 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-26 14:17:13,921 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-26 14:17:13,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:13,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,947 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:17:13,987 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:17:13,988 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:13,997 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:17:13,998 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:13,998 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1) = 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~1#1 Supporting invariants [] [2022-07-26 14:17:14,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-26 14:17:14,044 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-26 14:17:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:14,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:14,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:14,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:17:14,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:14,106 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:17:14,127 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:17:14,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 73 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:17:14,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 73 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 76 states and 182 transitions. Complement of second has 3 states. [2022-07-26 14:17:14,163 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:17:14,166 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:17:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-26 14:17:14,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:17:14,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:14,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:17:14,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:14,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:17:14,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:14,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 182 transitions. [2022-07-26 14:17:14,176 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 59 [2022-07-26 14:17:14,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 70 states and 171 transitions. [2022-07-26 14:17:14,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-26 14:17:14,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2022-07-26 14:17:14,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 171 transitions. [2022-07-26 14:17:14,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:14,185 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-26 14:17:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 171 transitions. [2022-07-26 14:17:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-07-26 14:17:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.449275362318841) internal successors, (169), 68 states have internal predecessors, (169), 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:17:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 169 transitions. [2022-07-26 14:17:14,210 INFO L242 hiAutomatonCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-07-26 14:17:14,210 INFO L426 stractBuchiCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-07-26 14:17:14,210 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:17:14,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 169 transitions. [2022-07-26 14:17:14,214 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 59 [2022-07-26 14:17:14,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:14,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:14,216 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-26 14:17:14,216 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:17:14,217 INFO L733 eck$LassoCheckResult]: Stem: 617#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 603#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 593#[L117-14]don't care [2022-07-26 14:17:14,219 INFO L735 eck$LassoCheckResult]: Loop: 593#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 593#[L117-14]don't care [2022-07-26 14:17:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash 24670, now seen corresponding path program 1 times [2022-07-26 14:17:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:14,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242455917] [2022-07-26 14:17:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 726, now seen corresponding path program 1 times [2022-07-26 14:17:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:14,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707769877] [2022-07-26 14:17:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 765465, now seen corresponding path program 1 times [2022-07-26 14:17:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:14,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100462973] [2022-07-26 14:17:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:14,827 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:17:15,400 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:15,401 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:15,401 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:15,401 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:15,401 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:15,401 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:15,401 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:15,401 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:15,401 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration2_Lasso [2022-07-26 14:17:15,401 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:15,401 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:15,403 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,406 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,408 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,409 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,412 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,414 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,416 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,418 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,420 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,421 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,424 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,426 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,428 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,430 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,432 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,433 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,435 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,436 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,439 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,441 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,443 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,444 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,445 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,449 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,451 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,453 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,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:17:15,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:17:15,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:17:15,747 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,749 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,750 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,752 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,754 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,755 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,757 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,758 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,761 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:15,763 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,201 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:16,202 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:16,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,206 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:17:16,209 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:17:16,216 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:17:16,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:16,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:16,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:16,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-26 14:17:16,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,255 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:17:16,256 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:17:16,257 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:17:16,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,295 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:17:16,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,297 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:17:16,299 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:17:16,299 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:17:16,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:16,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:16,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:16,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,321 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:17:16,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,322 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:17:16,324 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:17:16,325 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:17:16,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:16,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,358 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:17:16,359 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:17:16,360 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:17:16,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,398 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:17:16,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,407 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:17:16,426 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:17:16,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,436 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:17:16,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,460 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:17:16,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,461 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:17:16,462 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:17:16,463 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:17:16,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:16,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:16,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:16,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,499 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:17:16,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,501 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:17:16,502 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:17:16,503 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:17:16,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,540 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:17:16,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,541 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:17:16,542 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:17:16,543 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:17:16,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,580 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:17:16,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,582 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:17:16,583 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:17:16,584 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:17:16,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:16,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:16,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:16,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-26 14:17:16,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,621 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:17:16,622 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:17:16,623 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:17:16,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,660 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:17:16,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,662 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:17:16,663 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:17:16,664 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:17:16,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:16,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:16,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:16,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,701 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:17:16,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,702 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:17:16,703 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:17:16,704 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:17:16,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,731 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:17:16,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,733 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:17:16,733 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:17:16,735 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:17:16,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:16,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:16,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:16,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-26 14:17:16,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,773 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:17:16,774 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:17:16,775 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:17:16,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,812 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:17:16,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,813 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:17:16,814 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:17:16,816 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:17:16,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:16,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:16,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:16,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,852 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:17:16,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,854 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:17:16,855 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:17:16,856 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:17:16,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,893 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:17:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,894 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:17:16,895 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:17:16,897 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:17:16,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:16,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:16,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,935 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:17:16,936 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:17:16,937 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:17:16,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:16,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:16,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:16,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:16,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 14:17:16,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:16,976 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:17:16,976 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:17:16,978 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:17:16,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:16,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:16,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:16,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:16,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:16,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-26 14:17:17,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,016 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:17:17,017 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:17:17,019 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:17:17,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:17,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:17,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:17,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:17,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,042 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:17:17,042 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:17:17,044 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:17:17,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:17,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:17,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:17,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 14:17:17,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,088 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:17:17,089 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:17:17,090 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:17:17,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-26 14:17:17,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,128 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:17:17,129 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:17:17,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:17,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-26 14:17:17,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,168 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:17:17,169 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:17:17,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:17:17,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:17,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:17,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:17,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-26 14:17:17,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,208 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:17:17,209 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:17:17,210 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:17:17,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:17,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:17,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:17,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-26 14:17:17,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,248 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:17:17,249 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:17:17,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:17:17,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-26 14:17:17,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,288 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:17:17,289 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:17:17,290 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:17:17,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:17,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:17,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:17,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,326 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:17:17,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,328 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:17:17,329 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:17:17,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:17:17,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-26 14:17:17,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,368 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:17:17,369 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:17:17,370 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:17:17,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,408 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:17:17,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,410 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:17:17,410 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:17:17,411 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:17:17,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,449 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:17:17,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,451 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:17:17,452 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:17:17,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:17:17,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,478 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:17:17,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,479 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:17:17,480 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:17:17,481 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:17:17,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-26 14:17:17,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,520 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:17:17,521 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:17:17,522 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:17:17,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-26 14:17:17,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,561 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:17:17,561 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:17:17,562 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:17:17,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-26 14:17:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,602 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:17:17,602 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:17:17,603 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:17:17,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,609 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:17:17,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,612 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:17:17,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:17,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,646 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:17:17,647 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:17:17,648 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:17:17,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:17,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-26 14:17:17,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,675 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:17:17,677 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:17:17,677 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:17:17,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:17,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:17,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:17,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:17,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:17,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:17,713 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:17,745 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 14:17:17,745 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-26 14:17:17,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:17,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:17,749 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:17:17,750 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:17:17,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:17,756 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:17:17,757 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:17,757 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:17:17,772 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:17:17,807 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-26 14:17:17,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:17,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:17,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:17,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:17:17,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:17,844 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:17:17,844 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:17:17,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 169 transitions. cyclomatic complexity: 114 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:17:17,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 169 transitions. cyclomatic complexity: 114. 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 135 states and 335 transitions. Complement of second has 4 states. [2022-07-26 14:17:17,879 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:17:17,880 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:17:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-07-26 14:17:17,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:17:17,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:17,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-26 14:17:17,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:17,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-26 14:17:17,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:17,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 335 transitions. [2022-07-26 14:17:17,882 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:17,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 70 states and 171 transitions. [2022-07-26 14:17:17,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-26 14:17:17,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-26 14:17:17,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 171 transitions. [2022-07-26 14:17:17,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:17,883 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-26 14:17:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 171 transitions. [2022-07-26 14:17:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-26 14:17:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.442857142857143) internal successors, (171), 69 states have internal predecessors, (171), 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:17:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 171 transitions. [2022-07-26 14:17:17,887 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-26 14:17:17,887 INFO L426 stractBuchiCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-26 14:17:17,887 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:17:17,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 171 transitions. [2022-07-26 14:17:17,888 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:17,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:17,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:17,888 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:17:17,888 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:17,889 INFO L733 eck$LassoCheckResult]: Stem: 999#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 985#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 973#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 873#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 875#[L101-4, L59]don't care [2022-07-26 14:17:17,889 INFO L735 eck$LassoCheckResult]: Loop: 875#[L101-4, L59]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31) (not (<= v_~last~0_16 |v_thread1Thread1of1ForFork0_#t~mem1#1_23|))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 887#[L101-4, L49-4]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 875#[L101-4, L59]don't care [2022-07-26 14:17:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash 23731352, now seen corresponding path program 1 times [2022-07-26 14:17:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:17,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962373722] [2022-07-26 14:17:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:17,932 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:17:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962373722] [2022-07-26 14:17:17,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962373722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:17,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:17,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:17:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134330206] [2022-07-26 14:17:17,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:17,935 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:17:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:17,935 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 1 times [2022-07-26 14:17:17,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:17,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450359599] [2022-07-26 14:17:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:17,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:17,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:17,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:17,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:17,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:17:17,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:17:17,968 INFO L87 Difference]: Start difference. First operand 70 states and 171 transitions. cyclomatic complexity: 115 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:17:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:17,999 INFO L93 Difference]: Finished difference Result 70 states and 170 transitions. [2022-07-26 14:17:17,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 170 transitions. [2022-07-26 14:17:18,000 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:18,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 170 transitions. [2022-07-26 14:17:18,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-26 14:17:18,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-26 14:17:18,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 170 transitions. [2022-07-26 14:17:18,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:18,001 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-26 14:17:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 170 transitions. [2022-07-26 14:17:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-26 14:17:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 69 states have internal predecessors, (170), 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:17:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 170 transitions. [2022-07-26 14:17:18,004 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-26 14:17:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:17:18,005 INFO L426 stractBuchiCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-26 14:17:18,005 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:17:18,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 170 transitions. [2022-07-26 14:17:18,006 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:18,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:18,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:18,006 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:17:18,006 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:18,007 INFO L733 eck$LassoCheckResult]: Stem: 1215#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1201#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1189#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1191#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1095#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1097#[L101-4, L59]don't care [2022-07-26 14:17:18,007 INFO L735 eck$LassoCheckResult]: Loop: 1097#[L101-4, L59]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31) (not (<= v_~last~0_16 |v_thread1Thread1of1ForFork0_#t~mem1#1_23|))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1103#[L101-4, L49-4]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 1097#[L101-4, L59]don't care [2022-07-26 14:17:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,007 INFO L85 PathProgramCache]: Analyzing trace with hash 735635347, now seen corresponding path program 1 times [2022-07-26 14:17:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318063753] [2022-07-26 14:17:18,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,024 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 2 times [2022-07-26 14:17:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38570585] [2022-07-26 14:17:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,043 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1724014598, now seen corresponding path program 1 times [2022-07-26 14:17:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719678064] [2022-07-26 14:17:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:18,105 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:17:18,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:18,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719678064] [2022-07-26 14:17:18,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719678064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:18,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:18,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 14:17:18,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456747097] [2022-07-26 14:17:18,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:18,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:18,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:17:18,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:17:18,136 INFO L87 Difference]: Start difference. First operand 70 states and 170 transitions. cyclomatic complexity: 114 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:17:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:18,223 INFO L93 Difference]: Finished difference Result 133 states and 328 transitions. [2022-07-26 14:17:18,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 328 transitions. [2022-07-26 14:17:18,225 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 86 [2022-07-26 14:17:18,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 328 transitions. [2022-07-26 14:17:18,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2022-07-26 14:17:18,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2022-07-26 14:17:18,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 328 transitions. [2022-07-26 14:17:18,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:18,227 INFO L220 hiAutomatonCegarLoop]: Abstraction has 133 states and 328 transitions. [2022-07-26 14:17:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 328 transitions. [2022-07-26 14:17:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 71. [2022-07-26 14:17:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.436619718309859) internal successors, (173), 70 states have internal predecessors, (173), 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:17:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 173 transitions. [2022-07-26 14:17:18,231 INFO L242 hiAutomatonCegarLoop]: Abstraction has 71 states and 173 transitions. [2022-07-26 14:17:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:17:18,232 INFO L426 stractBuchiCegarLoop]: Abstraction has 71 states and 173 transitions. [2022-07-26 14:17:18,232 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:17:18,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 173 transitions. [2022-07-26 14:17:18,232 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:18,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:18,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:18,233 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:17:18,233 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:18,233 INFO L733 eck$LassoCheckResult]: Stem: 1504#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1490#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1480#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1482#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1382#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1384#[L101-4, L59]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 1386#[L102-3, L59]don't care [2022-07-26 14:17:18,233 INFO L735 eck$LassoCheckResult]: Loop: 1386#[L102-3, L59]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31) (not (<= v_~last~0_16 |v_thread1Thread1of1ForFork0_#t~mem1#1_23|))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1394#[L49-4, L102-3]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 1386#[L102-3, L59]don't care [2022-07-26 14:17:18,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1329859971, now seen corresponding path program 1 times [2022-07-26 14:17:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618480406] [2022-07-26 14:17:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 3 times [2022-07-26 14:17:18,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620833141] [2022-07-26 14:17:18,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1904801302, now seen corresponding path program 1 times [2022-07-26 14:17:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796101604] [2022-07-26 14:17:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:18,357 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:17:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:18,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796101604] [2022-07-26 14:17:18,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796101604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:18,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:18,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-26 14:17:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144332135] [2022-07-26 14:17:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-26 14:17:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-26 14:17:18,384 INFO L87 Difference]: Start difference. First operand 71 states and 173 transitions. cyclomatic complexity: 116 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:17:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:18,474 INFO L93 Difference]: Finished difference Result 124 states and 297 transitions. [2022-07-26 14:17:18,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 297 transitions. [2022-07-26 14:17:18,475 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 82 [2022-07-26 14:17:18,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 297 transitions. [2022-07-26 14:17:18,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-07-26 14:17:18,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-07-26 14:17:18,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 297 transitions. [2022-07-26 14:17:18,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:18,477 INFO L220 hiAutomatonCegarLoop]: Abstraction has 124 states and 297 transitions. [2022-07-26 14:17:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 297 transitions. [2022-07-26 14:17:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 80. [2022-07-26 14:17:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.525) internal successors, (202), 79 states have internal predecessors, (202), 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:17:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 202 transitions. [2022-07-26 14:17:18,481 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 202 transitions. [2022-07-26 14:17:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:17:18,482 INFO L426 stractBuchiCegarLoop]: Abstraction has 80 states and 202 transitions. [2022-07-26 14:17:18,482 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:17:18,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 202 transitions. [2022-07-26 14:17:18,482 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-26 14:17:18,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:18,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:18,483 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:17:18,483 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:17:18,483 INFO L733 eck$LassoCheckResult]: Stem: 1803#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1787#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1765#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1767#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1663#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1665#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1669#[L49-2, L101-4]don't care [2022-07-26 14:17:18,484 INFO L735 eck$LassoCheckResult]: Loop: 1669#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 1739#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 1741#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 1673#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1669#[L49-2, L101-4]don't care [2022-07-26 14:17:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1329859928, now seen corresponding path program 1 times [2022-07-26 14:17:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408709703] [2022-07-26 14:17:18,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 1 times [2022-07-26 14:17:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254194773] [2022-07-26 14:17:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash -899042998, now seen corresponding path program 1 times [2022-07-26 14:17:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363983624] [2022-07-26 14:17:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 14:17:18,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:18,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363983624] [2022-07-26 14:17:18,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363983624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:18,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:18,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:17:18,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070281621] [2022-07-26 14:17:18,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:18,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:18,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:17:18,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:17:18,723 INFO L87 Difference]: Start difference. First operand 80 states and 202 transitions. cyclomatic complexity: 138 Second operand has 4 states, 4 states have (on average 2.5) 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:17:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:18,766 INFO L93 Difference]: Finished difference Result 109 states and 250 transitions. [2022-07-26 14:17:18,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 250 transitions. [2022-07-26 14:17:18,767 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-26 14:17:18,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 80 states and 201 transitions. [2022-07-26 14:17:18,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-26 14:17:18,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-26 14:17:18,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 201 transitions. [2022-07-26 14:17:18,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:18,768 INFO L220 hiAutomatonCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-26 14:17:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 201 transitions. [2022-07-26 14:17:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-26 14:17:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.5125) internal successors, (201), 79 states have internal predecessors, (201), 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:17:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 201 transitions. [2022-07-26 14:17:18,771 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-26 14:17:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:17:18,772 INFO L426 stractBuchiCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-26 14:17:18,772 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 14:17:18,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 201 transitions. [2022-07-26 14:17:18,773 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-26 14:17:18,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:18,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:18,773 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:18,773 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:17:18,774 INFO L733 eck$LassoCheckResult]: Stem: 2081#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2065#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2067#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 2043#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2045#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1941#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1943#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1947#[L49-2, L101-4]don't care [2022-07-26 14:17:18,774 INFO L735 eck$LassoCheckResult]: Loop: 1947#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 2017#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 2019#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 1955#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1947#[L49-2, L101-4]don't care [2022-07-26 14:17:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1607490177, now seen corresponding path program 1 times [2022-07-26 14:17:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677789750] [2022-07-26 14:17:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 2 times [2022-07-26 14:17:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142295352] [2022-07-26 14:17:18,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:18,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:18,810 INFO L85 PathProgramCache]: Analyzing trace with hash -196525581, now seen corresponding path program 1 times [2022-07-26 14:17:18,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:18,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856410712] [2022-07-26 14:17:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:18,873 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:17:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:18,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856410712] [2022-07-26 14:17:18,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856410712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:17:18,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937147331] [2022-07-26 14:17:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:18,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:17:18,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,875 INFO L229 MonitoredProcess]: Starting monitored process 55 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:17:18,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-07-26 14:17:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:18,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:17:18,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:18,995 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:17:18,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:17:19,044 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:17:19,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937147331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:17:19,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:17:19,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-07-26 14:17:19,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814709736] [2022-07-26 14:17:19,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:17:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-26 14:17:19,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-26 14:17:19,168 INFO L87 Difference]: Start difference. First operand 80 states and 201 transitions. cyclomatic complexity: 137 Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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:17:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:19,436 INFO L93 Difference]: Finished difference Result 205 states and 473 transitions. [2022-07-26 14:17:19,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 473 transitions. [2022-07-26 14:17:19,438 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 118 [2022-07-26 14:17:19,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 195 states and 450 transitions. [2022-07-26 14:17:19,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2022-07-26 14:17:19,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2022-07-26 14:17:19,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 450 transitions. [2022-07-26 14:17:19,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:19,440 INFO L220 hiAutomatonCegarLoop]: Abstraction has 195 states and 450 transitions. [2022-07-26 14:17:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 450 transitions. [2022-07-26 14:17:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2022-07-26 14:17:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 2.5163934426229506) internal successors, (307), 121 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:17:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 307 transitions. [2022-07-26 14:17:19,444 INFO L242 hiAutomatonCegarLoop]: Abstraction has 122 states and 307 transitions. [2022-07-26 14:17:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-26 14:17:19,445 INFO L426 stractBuchiCegarLoop]: Abstraction has 122 states and 307 transitions. [2022-07-26 14:17:19,445 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-26 14:17:19,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 307 transitions. [2022-07-26 14:17:19,446 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 82 [2022-07-26 14:17:19,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:19,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:19,446 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:19,446 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:17:19,447 INFO L733 eck$LassoCheckResult]: Stem: 2555#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2519#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2521#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 2497#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2499#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2501#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2615#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 2591#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 2551#[L49-2, L101-4]don't care [2022-07-26 14:17:19,447 INFO L735 eck$LassoCheckResult]: Loop: 2551#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 2463#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 2465#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 2415#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 2551#[L49-2, L101-4]don't care [2022-07-26 14:17:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1708565110, now seen corresponding path program 2 times [2022-07-26 14:17:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:19,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689985269] [2022-07-26 14:17:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 3 times [2022-07-26 14:17:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:19,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688639249] [2022-07-26 14:17:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:19,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2065196932, now seen corresponding path program 2 times [2022-07-26 14:17:19,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:19,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254383184] [2022-07-26 14:17:19,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:19,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:21,578 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:21,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:21,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:21,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:21,578 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:21,578 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:21,578 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:21,578 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:21,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration8_Lasso [2022-07-26 14:17:21,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:21,578 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:21,581 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,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:17:21,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:17:21,585 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,586 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,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:17:21,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:17:21,591 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,592 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,593 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,597 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,598 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,600 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,601 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,604 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,606 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,608 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,609 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:21,611 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,718 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,720 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,721 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,723 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,724 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,726 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,727 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,729 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,731 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,732 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,734 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,735 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,736 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,738 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,739 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,741 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,742 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,744 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,746 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:23,299 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:23,300 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:23,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,301 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:17:23,302 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:17:23,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:23,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,324 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:17:23,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,326 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:17:23,328 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:17:23,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:17:23,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-26 14:17:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,352 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:17:23,353 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:17:23,354 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:17:23,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,376 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:17:23,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,377 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:17:23,377 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:17:23,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:17:23,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,399 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:17:23,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,401 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:17:23,402 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:17:23,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:17:23,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:23,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,433 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:17:23,434 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:17:23,435 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:17:23,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,473 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:17:23,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,475 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:17:23,494 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:17:23,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,505 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:17:23,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-26 14:17:23,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,526 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:17:23,527 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:17:23,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:17:23,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,565 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:17:23,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,566 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:17:23,567 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:17:23,568 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:17:23,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,590 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:17:23,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,591 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:17:23,591 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:17:23,593 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:17:23,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-26 14:17:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,615 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:17:23,616 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:17:23,618 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:17:23,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-26 14:17:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,641 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:17:23,642 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:17:23,643 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:17:23,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-26 14:17:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,666 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:17:23,666 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:17:23,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:17:23,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,688 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:17:23,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,689 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:17:23,690 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:17:23,691 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:17:23,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:23,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,716 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:17:23,717 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:17:23,718 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:17:23,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-26 14:17:23,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,756 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:17:23,757 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:17:23,758 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:17:23,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-26 14:17:23,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,783 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:17:23,784 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:17:23,785 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:17:23,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:23,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,819 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:17:23,820 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:17:23,821 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:17:23,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:23,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:23,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:23,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-26 14:17:23,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,845 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:17:23,846 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:17:23,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:17:23,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,874 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:17:23,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,875 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:17:23,876 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:17:23,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:17:23,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:23,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,910 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:17:23,911 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:17:23,912 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:17:23,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,938 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:17:23,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,939 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:17:23,940 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:17:23,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:17:23,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,965 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:17:23,965 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:17:23,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:17:23,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:23,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:23,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:23,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:23,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:23,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:23,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:23,991 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:17:23,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:23,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:23,993 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:17:23,993 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:17:23,994 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:17:23,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-26 14:17:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,020 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:17:24,021 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:17:24,022 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:17:24,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,060 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:17:24,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,061 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:17:24,062 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:17:24,063 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:17:24,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,086 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:17:24,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,087 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:17:24,088 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:17:24,089 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:17:24,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-26 14:17:24,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,132 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:17:24,133 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:17:24,134 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:17:24,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,167 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:17:24,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,168 INFO L229 MonitoredProcess]: Starting monitored process 84 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:17:24,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-26 14:17:24,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:17:24,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-26 14:17:24,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,195 INFO L229 MonitoredProcess]: Starting monitored process 85 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:17:24,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-26 14:17:24,197 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:17:24,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-07-26 14:17:24,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,225 INFO L229 MonitoredProcess]: Starting monitored process 86 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:17:24,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-26 14:17:24,226 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:17:24,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:24,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,265 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:17:24,266 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:17:24,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:24,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,273 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:17:24,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,278 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:17:24,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,301 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:17:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,302 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:17:24,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:17:24,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,315 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:17:24,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,339 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:17:24,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,340 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:17:24,341 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:17:24,342 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:17:24,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,364 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:17:24,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,366 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:17:24,366 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:17:24,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:17:24,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:24,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,406 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:17:24,406 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:17:24,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:17:24,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:24,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:24,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,435 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:17:24,435 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:17:24,436 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:17:24,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:24,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:24,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:24,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:24,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:24,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:24,486 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:24,520 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-26 14:17:24,520 INFO L444 ModelExtractionUtils]: 18 out of 52 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-07-26 14:17:24,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:24,536 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:17:24,560 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:17:24,560 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:24,570 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:17:24,570 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:24,570 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~end~0, ~n~0) = -1*~end~0 + 1*~n~0 Supporting invariants [] [2022-07-26 14:17:24,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:24,715 INFO L156 tatePredicateManager]: 50 out of 50 supporting invariants were superfluous and have been removed [2022-07-26 14:17:24,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:24,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:24,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:24,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:17:24,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:24,785 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:17:24,785 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:17:24,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211 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:17:24,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:24,857 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211. 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 307 states and 788 transitions. Complement of second has 4 states. [2022-07-26 14:17:24,857 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:17:24,857 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:17:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-07-26 14:17:24,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-26 14:17:24,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:24,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-26 14:17:24,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:24,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 8 letters. Loop has 8 letters. [2022-07-26 14:17:24,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:24,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 788 transitions. [2022-07-26 14:17:24,860 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 72 [2022-07-26 14:17:24,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 266 states and 672 transitions. [2022-07-26 14:17:24,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-07-26 14:17:24,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2022-07-26 14:17:24,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 672 transitions. [2022-07-26 14:17:24,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:17:24,863 INFO L220 hiAutomatonCegarLoop]: Abstraction has 266 states and 672 transitions. [2022-07-26 14:17:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 672 transitions. [2022-07-26 14:17:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 195. [2022-07-26 14:17:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 2.712820512820513) internal successors, (529), 194 states have internal predecessors, (529), 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:17:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 529 transitions. [2022-07-26 14:17:24,868 INFO L242 hiAutomatonCegarLoop]: Abstraction has 195 states and 529 transitions. [2022-07-26 14:17:24,868 INFO L426 stractBuchiCegarLoop]: Abstraction has 195 states and 529 transitions. [2022-07-26 14:17:24,868 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-26 14:17:24,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 529 transitions. [2022-07-26 14:17:24,869 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 60 [2022-07-26 14:17:24,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:24,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:24,870 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:24,870 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:24,870 INFO L733 eck$LassoCheckResult]: Stem: 3463#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3425#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 3427#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 3387#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 3389#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3209#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 3211#[L101-4, L59]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 3549#[L102-3, L59]don't care [545] L102-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_10|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3543#[L59, L102-4, thread2ENTRY]don't care [530] thread2ENTRY-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] 3545#[L79, L59, L102-4]don't care [2022-07-26 14:17:24,870 INFO L735 eck$LassoCheckResult]: Loop: 3545#[L79, L59, L102-4]don't care [646] L79-->L76: Formula: (let ((.cse0 (* v_~start~0_47 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_35))) (and (<= (+ .cse0 4 v_~queue~0.offset_35) (select |v_#length_83| v_~queue~0.base_35)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_15| 256) 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~v_old~0_16 v_~new~0_27)) 1 0) 0) 0 1) v_~ok~0_16) (<= 0 .cse1) (= (ite (and (< v_~start~0_47 v_~end~0_68) (<= 0 v_~start~0_47) (< v_~start~0_47 v_~n~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (select |v_#valid_98| v_~queue~0.base_35) 1) (= v_~start~0_46 (+ v_~start~0_47 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= v_~new~0_27 (select (select |v_#memory_int_75| v_~queue~0.base_35) .cse1))))) InVars {~start~0=v_~start~0_47, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_17, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_36} OutVars{~new~0=v_~new~0_27, ~start~0=v_~start~0_46, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_16, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_7|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_7|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~n~0=v_~n~0_36} AuxVars[] AssignedVars[~new~0, ~start~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 3571#[L76, L59, L102-4]don't care [570] L76-->L79: Formula: (and (= v_~new~0_19 v_~v_old~0_6) (= |v_thread2Thread1of1ForFork1_~cond~0#1_11| (ite (= (ite (or (< v_~i~0_37 v_~N~0_11) (< v_~start~0_36 v_~end~0_60)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_36, ~new~0=v_~new~0_19, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11} OutVars{~start~0=v_~start~0_36, ~new~0=v_~new~0_19, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_11|, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11, ~v_old~0=v_~v_old~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1, ~v_old~0] 3545#[L79, L59, L102-4]don't care [2022-07-26 14:17:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1390107715, now seen corresponding path program 1 times [2022-07-26 14:17:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:24,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542714785] [2022-07-26 14:17:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:24,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:24,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 1 times [2022-07-26 14:17:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:24,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025586725] [2022-07-26 14:17:24,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:24,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:24,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:24,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:24,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -158664463, now seen corresponding path program 1 times [2022-07-26 14:17:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:24,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304839002] [2022-07-26 14:17:24,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:24,937 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:17:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:24,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304839002] [2022-07-26 14:17:24,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304839002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:24,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:24,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:17:24,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400380902] [2022-07-26 14:17:24,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:17:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:17:25,093 INFO L87 Difference]: Start difference. First operand 195 states and 529 transitions. cyclomatic complexity: 374 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:17:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:25,139 INFO L93 Difference]: Finished difference Result 207 states and 512 transitions. [2022-07-26 14:17:25,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 512 transitions. [2022-07-26 14:17:25,141 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 52 [2022-07-26 14:17:25,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 192 states and 471 transitions. [2022-07-26 14:17:25,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2022-07-26 14:17:25,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2022-07-26 14:17:25,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 471 transitions. [2022-07-26 14:17:25,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:17:25,142 INFO L220 hiAutomatonCegarLoop]: Abstraction has 192 states and 471 transitions. [2022-07-26 14:17:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 471 transitions. [2022-07-26 14:17:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 185. [2022-07-26 14:17:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 185 states have (on average 2.4756756756756757) internal successors, (458), 184 states have internal predecessors, (458), 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:17:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 458 transitions. [2022-07-26 14:17:25,146 INFO L242 hiAutomatonCegarLoop]: Abstraction has 185 states and 458 transitions. [2022-07-26 14:17:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:17:25,148 INFO L426 stractBuchiCegarLoop]: Abstraction has 185 states and 458 transitions. [2022-07-26 14:17:25,148 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-26 14:17:25,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 458 transitions. [2022-07-26 14:17:25,149 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 52 [2022-07-26 14:17:25,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:25,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:25,149 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:25,150 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:25,150 INFO L733 eck$LassoCheckResult]: Stem: 4092#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4044#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 4046#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 3998#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 4000#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3820#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 3822#[L101-4, L59]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 3824#[L102-3, L59]don't care [545] L102-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_10|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3926#[L59, L102-4, thread2ENTRY]don't care [530] thread2ENTRY-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] 3868#[L79, L59, L102-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 3870#[L49-2, L79, L102-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 3800#[L79, L102-4, L54]don't care [2022-07-26 14:17:25,150 INFO L735 eck$LassoCheckResult]: Loop: 3800#[L79, L102-4, L54]don't care [646] L79-->L76: Formula: (let ((.cse0 (* v_~start~0_47 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_35))) (and (<= (+ .cse0 4 v_~queue~0.offset_35) (select |v_#length_83| v_~queue~0.base_35)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_15| 256) 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~v_old~0_16 v_~new~0_27)) 1 0) 0) 0 1) v_~ok~0_16) (<= 0 .cse1) (= (ite (and (< v_~start~0_47 v_~end~0_68) (<= 0 v_~start~0_47) (< v_~start~0_47 v_~n~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (select |v_#valid_98| v_~queue~0.base_35) 1) (= v_~start~0_46 (+ v_~start~0_47 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= v_~new~0_27 (select (select |v_#memory_int_75| v_~queue~0.base_35) .cse1))))) InVars {~start~0=v_~start~0_47, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_17, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_36} OutVars{~new~0=v_~new~0_27, ~start~0=v_~start~0_46, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_16, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_7|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_7|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~n~0=v_~n~0_36} AuxVars[] AssignedVars[~new~0, ~start~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 3962#[L76, L102-4, L54]don't care [570] L76-->L79: Formula: (and (= v_~new~0_19 v_~v_old~0_6) (= |v_thread2Thread1of1ForFork1_~cond~0#1_11| (ite (= (ite (or (< v_~i~0_37 v_~N~0_11) (< v_~start~0_36 v_~end~0_60)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_36, ~new~0=v_~new~0_19, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11} OutVars{~start~0=v_~start~0_36, ~new~0=v_~new~0_19, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_11|, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11, ~v_old~0=v_~v_old~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1, ~v_old~0] 3800#[L79, L102-4, L54]don't care [2022-07-26 14:17:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash -158664272, now seen corresponding path program 1 times [2022-07-26 14:17:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:25,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817484105] [2022-07-26 14:17:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:25,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:25,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:25,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:25,184 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 2 times [2022-07-26 14:17:25,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:25,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659399140] [2022-07-26 14:17:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:25,187 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:25,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:25,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2142477860, now seen corresponding path program 1 times [2022-07-26 14:17:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:25,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692439751] [2022-07-26 14:17:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:25,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:25,213 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:25,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:27,880 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:27,880 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:27,880 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:27,880 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:27,880 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:27,880 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:27,880 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:27,880 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:27,880 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration10_Lasso [2022-07-26 14:17:27,880 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:27,880 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:27,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:17:27,887 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:27,889 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:27,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:17:27,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:17:27,893 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:27,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:17:27,896 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:27,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:17:27,899 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:27,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:17:27,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:17:27,907 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:27,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:17:27,910 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:27,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:17:29,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:17:29,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:17:29,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:17:29,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:17:29,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:17:29,347 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,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:17:29,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:17:29,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:17:29,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:17:29,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:17:29,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:17:29,361 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,362 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,364 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,365 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,366 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,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:17:29,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:17:29,370 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,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:17:29,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:17:29,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:17:29,376 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,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:17:29,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:17:29,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:17:30,733 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:30,733 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:30,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,739 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:17:30,739 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:17:30,740 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:17:30,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:30,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:30,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:30,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,763 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:17:30,765 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:17:30,766 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:17:30,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:30,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:30,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:30,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:30,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,803 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:17:30,804 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:17:30,805 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:17:30,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:30,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:30,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:30,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,827 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:17:30,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,828 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:17:30,829 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:17:30,830 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:17:30,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:30,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:30,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:30,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,856 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:17:30,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,857 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:17:30,858 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:17:30,859 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:17:30,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:30,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:30,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:30,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:30,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,897 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:17:30,898 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:17:30,899 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:17:30,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,922 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:17:30,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,923 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:17:30,924 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:17:30,925 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:17:30,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:30,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:30,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:30,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,946 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:17:30,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,948 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:17:30,948 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:17:30,949 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:17:30,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:30,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:30,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:30,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,970 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:17:30,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,971 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:17:30,972 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:17:30,973 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:17:30,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-26 14:17:31,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,011 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:17:31,012 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:17:31,014 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:17:31,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:31,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:31,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:31,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,035 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:17:31,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,036 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:17:31,037 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:17:31,038 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:17:31,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:31,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:31,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:31,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,059 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:17:31,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,060 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:17:31,061 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:17:31,062 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:17:31,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:31,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:31,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:31,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-07-26 14:17:31,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,084 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:17:31,085 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:17:31,086 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:17:31,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,109 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:17:31,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,110 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:17:31,110 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:17:31,126 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:17:31,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,150 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:17:31,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,152 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:17:31,153 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:17:31,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:31,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:31,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:31,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:31,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,175 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:17:31,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,176 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:17:31,177 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:17:31,178 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:17:31,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,217 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:17:31,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,218 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:17:31,219 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:17:31,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:31,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:31,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,248 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:17:31,249 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:17:31,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:17:31,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,273 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:17:31,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,274 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:17:31,275 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:17:31,276 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:17:31,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,313 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:17:31,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,314 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:17:31,315 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:17:31,316 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:17:31,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-26 14:17:31,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,341 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:17:31,342 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:17:31,343 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:17:31,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,349 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-26 14:17:31,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,429 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2022-07-26 14:17:31,429 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-07-26 14:17:31,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,502 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:17:31,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,503 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:17:31,504 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:17:31,505 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:17:31,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,530 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:17:31,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,531 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:17:31,532 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:17:31,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:31,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,539 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:17:31,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,544 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:17:31,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,566 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:17:31,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,567 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:17:31,568 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:17:31,569 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:17:31,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,605 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:17:31,606 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:17:31,608 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:17:31,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:31,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,646 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:17:31,647 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:17:31,648 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:17:31,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,671 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:17:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,672 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:17:31,673 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:17:31,678 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:17:31,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:31,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:31,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:31,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:31,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,710 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:17:31,710 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:17:31,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:31,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:31,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:31,718 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 14:17:31,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:31,756 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-26 14:17:31,756 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 14:17:31,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:31,939 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2022-07-26 14:17:31,940 INFO L444 ModelExtractionUtils]: 48 out of 96 variables were initially zero. Simplification set additionally 45 variables to zero. [2022-07-26 14:17:31,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,941 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:17:31,942 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:17:31,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:31,958 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-07-26 14:17:31,959 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:31,959 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~start~0, ~n~0) = -2*~start~0 + 1*~n~0 Supporting invariants [] [2022-07-26 14:17:31,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:32,210 INFO L156 tatePredicateManager]: 59 out of 61 supporting invariants were superfluous and have been removed [2022-07-26 14:17:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:32,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-26 14:17:32,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:32,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-26 14:17:32,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:32,418 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:17:32,418 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2022-07-26 14:17:32,418 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 185 states and 458 transitions. cyclomatic complexity: 307 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:17:32,545 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 185 states and 458 transitions. cyclomatic complexity: 307. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 610 states and 1588 transitions. Complement of second has 9 states. [2022-07-26 14:17:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2022-07-26 14:17:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:17:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-07-26 14:17:32,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:17:32,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:32,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-26 14:17:32,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:32,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-26 14:17:32,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:32,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 610 states and 1588 transitions. [2022-07-26 14:17:32,551 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 72 [2022-07-26 14:17:32,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 610 states to 443 states and 1171 transitions. [2022-07-26 14:17:32,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2022-07-26 14:17:32,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2022-07-26 14:17:32,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 443 states and 1171 transitions. [2022-07-26 14:17:32,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:17:32,556 INFO L220 hiAutomatonCegarLoop]: Abstraction has 443 states and 1171 transitions. [2022-07-26 14:17:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states and 1171 transitions. [2022-07-26 14:17:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 373. [2022-07-26 14:17:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 373 states have (on average 2.689008042895442) internal successors, (1003), 372 states have internal predecessors, (1003), 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:17:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1003 transitions. [2022-07-26 14:17:32,564 INFO L242 hiAutomatonCegarLoop]: Abstraction has 373 states and 1003 transitions. [2022-07-26 14:17:32,564 INFO L426 stractBuchiCegarLoop]: Abstraction has 373 states and 1003 transitions. [2022-07-26 14:17:32,564 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-26 14:17:32,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 1003 transitions. [2022-07-26 14:17:32,566 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 68 [2022-07-26 14:17:32,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:32,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:32,567 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:32,567 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:32,567 INFO L733 eck$LassoCheckResult]: Stem: 5457#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5379#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 5381#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 5319#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 5321#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 5599#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5597#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 5591#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 5589#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 5575#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 5559#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 5549#[L101-4, L59]don't care [2022-07-26 14:17:32,567 INFO L735 eck$LassoCheckResult]: Loop: 5549#[L101-4, L59]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31) (not (<= v_~last~0_16 |v_thread1Thread1of1ForFork0_#t~mem1#1_23|))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 5547#[L101-4, L49-4]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 5549#[L101-4, L59]don't care [2022-07-26 14:17:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash -205166609, now seen corresponding path program 3 times [2022-07-26 14:17:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:32,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792746867] [2022-07-26 14:17:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:32,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:32,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 4 times [2022-07-26 14:17:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:32,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112784949] [2022-07-26 14:17:32,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:32,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:32,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 403405142, now seen corresponding path program 1 times [2022-07-26 14:17:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:32,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518497632] [2022-07-26 14:17:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:32,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:32,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:33,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:34,844 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:34,844 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:34,844 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:34,844 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:34,844 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:34,844 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:34,844 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:34,844 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:34,844 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration11_Lasso [2022-07-26 14:17:34,844 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:34,844 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:34,847 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,681 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,682 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,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:17:35,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:17:35,687 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,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:17:35,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:17:35,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:17:35,692 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,694 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,695 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,697 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,699 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,700 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,701 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,703 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,705 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,706 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,709 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,711 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,712 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,714 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,715 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,716 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,718 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,719 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,720 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,722 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,723 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,724 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,726 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,728 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,729 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,731 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,732 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,735 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,737 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:35,738 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:36,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:36,383 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:36,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,384 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:17:36,385 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:17:36,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:17:36,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,422 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:17:36,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,423 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:17:36,424 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:17:36,425 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:17:36,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,461 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:17:36,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,462 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:17:36,463 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:17:36,465 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:17:36,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,501 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:17:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,502 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:17:36,503 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:17:36,504 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:17:36,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,540 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:17:36,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,541 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:17:36,542 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:17:36,543 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:17:36,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,579 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:17:36,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,581 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:17:36,581 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:17:36,583 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:17:36,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,619 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:17:36,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,620 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:17:36,621 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:17:36,622 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:17:36,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-07-26 14:17:36,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,660 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:17:36,661 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:17:36,662 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:17:36,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,702 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:17:36,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,705 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:17:36,711 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:17:36,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,721 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:17:36,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:36,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,745 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:17:36,746 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:17:36,747 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:17:36,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:36,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,785 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:17:36,785 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:17:36,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:17:36,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:36,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,812 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:17:36,813 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:17:36,814 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:17:36,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,841 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:36,865 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-26 14:17:36,865 INFO L444 ModelExtractionUtils]: 25 out of 52 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-07-26 14:17:36,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,866 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:17:36,867 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:17:36,868 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:36,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:17:36,874 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:36,874 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i~0, ~N~0) = -1*~i~0 + 1*~N~0 Supporting invariants [] [2022-07-26 14:17:36,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-07-26 14:17:36,996 INFO L156 tatePredicateManager]: 48 out of 48 supporting invariants were superfluous and have been removed [2022-07-26 14:17:37,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:37,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:37,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:37,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:17:37,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:37,045 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:17:37,045 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:17:37,045 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 373 states and 1003 transitions. cyclomatic complexity: 703 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:17:37,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 373 states and 1003 transitions. cyclomatic complexity: 703. 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 773 states and 2243 transitions. Complement of second has 6 states. [2022-07-26 14:17:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-26 14:17:37,124 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:17:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-07-26 14:17:37,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:17:37,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:37,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-26 14:17:37,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:37,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-26 14:17:37,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:37,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 773 states and 2243 transitions. [2022-07-26 14:17:37,131 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 48 [2022-07-26 14:17:37,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 773 states to 483 states and 1314 transitions. [2022-07-26 14:17:37,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2022-07-26 14:17:37,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2022-07-26 14:17:37,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 1314 transitions. [2022-07-26 14:17:37,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:17:37,135 INFO L220 hiAutomatonCegarLoop]: Abstraction has 483 states and 1314 transitions. [2022-07-26 14:17:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 1314 transitions. [2022-07-26 14:17:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 421. [2022-07-26 14:17:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 421 states have (on average 2.776722090261283) internal successors, (1169), 420 states have internal predecessors, (1169), 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:17:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1169 transitions. [2022-07-26 14:17:37,142 INFO L242 hiAutomatonCegarLoop]: Abstraction has 421 states and 1169 transitions. [2022-07-26 14:17:37,142 INFO L426 stractBuchiCegarLoop]: Abstraction has 421 states and 1169 transitions. [2022-07-26 14:17:37,142 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-26 14:17:37,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 421 states and 1169 transitions. [2022-07-26 14:17:37,144 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 48 [2022-07-26 14:17:37,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:37,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:37,144 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:37,145 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:37,145 INFO L733 eck$LassoCheckResult]: Stem: 7205#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7143#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 7145#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 7147#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.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_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 7269#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 7267#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, 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_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6887#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 6889#[L101-4, L59]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 6897#[L102-3, L59]don't care [545] L102-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_10|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 6991#[L59, L102-4, thread2ENTRY]don't care [530] thread2ENTRY-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] 7583#[L79, L59, L102-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 7571#[L49-2, L79, L102-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 6873#[L79, L102-4, L54]don't care [2022-07-26 14:17:37,145 INFO L735 eck$LassoCheckResult]: Loop: 6873#[L79, L102-4, L54]don't care [646] L79-->L76: Formula: (let ((.cse0 (* v_~start~0_47 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_35))) (and (<= (+ .cse0 4 v_~queue~0.offset_35) (select |v_#length_83| v_~queue~0.base_35)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_15| 256) 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~v_old~0_16 v_~new~0_27)) 1 0) 0) 0 1) v_~ok~0_16) (<= 0 .cse1) (= (ite (and (< v_~start~0_47 v_~end~0_68) (<= 0 v_~start~0_47) (< v_~start~0_47 v_~n~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (select |v_#valid_98| v_~queue~0.base_35) 1) (= v_~start~0_46 (+ v_~start~0_47 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= v_~new~0_27 (select (select |v_#memory_int_75| v_~queue~0.base_35) .cse1))))) InVars {~start~0=v_~start~0_47, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_17, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_36} OutVars{~new~0=v_~new~0_27, ~start~0=v_~start~0_46, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_16, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_7|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_7|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~n~0=v_~n~0_36} AuxVars[] AssignedVars[~new~0, ~start~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 7029#[L76, L102-4, L54]don't care [570] L76-->L79: Formula: (and (= v_~new~0_19 v_~v_old~0_6) (= |v_thread2Thread1of1ForFork1_~cond~0#1_11| (ite (= (ite (or (< v_~i~0_37 v_~N~0_11) (< v_~start~0_36 v_~end~0_60)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_36, ~new~0=v_~new~0_19, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11} OutVars{~start~0=v_~start~0_36, ~new~0=v_~new~0_19, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_11|, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11, ~v_old~0=v_~v_old~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1, ~v_old~0] 6873#[L79, L102-4, L54]don't care [2022-07-26 14:17:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash 144539175, now seen corresponding path program 2 times [2022-07-26 14:17:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:37,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026122074] [2022-07-26 14:17:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:37,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:37,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 3 times [2022-07-26 14:17:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:37,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834163808] [2022-07-26 14:17:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:37,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:37,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1463214299, now seen corresponding path program 2 times [2022-07-26 14:17:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:37,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771744255] [2022-07-26 14:17:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:37,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:37,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:37,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:39,272 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:39,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:39,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:39,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:39,272 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:39,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:39,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:39,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:39,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration12_Lasso [2022-07-26 14:17:39,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:39,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:39,275 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,277 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,278 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,279 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,281 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,283 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,286 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,287 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,289 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,290 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,292 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,293 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,295 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,296 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,298 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:39,299 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,717 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,719 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,720 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,722 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,723 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,724 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,726 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,727 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,728 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,730 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,731 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,733 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,734 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,736 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,737 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,738 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,742 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,743 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,744 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,745 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,747 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,748 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,750 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,751 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,754 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,756 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:40,757 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:42,161 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:42,161 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:42,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,162 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:17:42,163 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:17:42,164 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:17:42,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,201 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:17:42,202 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:17:42,205 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:17:42,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,227 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:17:42,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,228 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:17:42,229 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:17:42,230 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:17:42,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,252 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:17:42,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,254 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:17:42,254 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:17:42,256 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:17:42,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:42,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,281 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:17:42,281 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:17:42,282 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:17:42,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,304 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:17:42,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,305 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:17:42,305 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:17:42,307 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:17:42,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:42,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,339 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:17:42,340 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:17:42,355 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:17:42,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,377 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:17:42,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,380 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:17:42,380 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:17:42,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:17:42,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-07-26 14:17:42,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,406 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:17:42,406 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:17:42,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:17:42,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,432 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:17:42,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,433 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:17:42,434 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:17:42,435 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:17:42,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2022-07-26 14:17:42,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,457 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:17:42,458 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:17:42,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:17:42,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,495 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:17:42,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,496 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:17:42,497 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:17:42,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:42,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:42,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,526 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:17:42,527 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:17:42,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:17:42,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,552 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:17:42,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,553 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:17:42,554 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:17:42,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:17:42,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,576 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:17:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,577 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:17:42,578 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:17:42,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:17:42,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:42,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:42,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:42,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,601 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:17:42,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,602 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:17:42,603 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:17:42,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:17:42,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,642 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:17:42,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,643 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:17:42,643 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:17:42,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:17:42,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2022-07-26 14:17:42,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,668 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:17:42,669 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:17:42,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:17:42,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:42,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,695 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:17:42,707 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:17:42,707 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:17:42,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,730 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:17:42,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,731 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:17:42,732 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:17:42,733 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:17:42,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:42,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,771 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:17:42,771 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:17:42,773 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:17:42,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2022-07-26 14:17:42,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,798 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:17:42,798 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:17:42,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:17:42,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:42,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,823 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:17:42,824 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:17:42,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:17:42,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2022-07-26 14:17:42,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,850 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:17:42,850 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:17:42,851 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:17:42,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,857 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:17:42,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,861 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:17:42,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,902 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:17:42,902 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:17:42,904 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:17:42,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,926 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:17:42,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,927 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:17:42,928 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:17:42,930 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:17:42,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:42,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:42,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:42,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:42,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:42,952 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:17:42,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:42,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:42,953 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:17:42,954 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:17:42,957 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:17:42,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:42,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:42,963 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-26 14:17:42,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:43,002 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2022-07-26 14:17:43,002 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-07-26 14:17:43,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:43,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:43,096 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:17:43,096 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:17:43,099 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:17:43,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:43,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:43,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:43,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:43,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:43,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:43,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:43,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2022-07-26 14:17:43,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:43,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:43,131 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:17:43,131 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:17:43,133 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:17:43,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:43,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:43,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:43,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:43,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:43,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:43,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:43,157 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:17:43,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:43,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:43,158 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:17:43,158 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:17:43,160 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:17:43,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:43,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:43,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:43,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:43,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:43,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:43,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:43,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2022-07-26 14:17:43,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:43,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:43,187 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:17:43,187 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:17:43,189 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:17:43,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:43,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:43,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:43,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:43,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:43,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:43,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:43,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:43,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:43,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:43,212 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:17:43,212 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:17:43,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:43,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:43,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:43,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:43,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:43,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:43,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:43,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:43,237 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:17:43,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:43,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:43,239 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:17:43,239 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:17:43,241 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:17:43,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:43,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:43,246 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-26 14:17:43,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:43,292 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2022-07-26 14:17:43,292 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-07-26 14:17:43,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:43,852 INFO L443 ModelExtractionUtils]: Simplification made 54 calls to the SMT solver. [2022-07-26 14:17:43,853 INFO L444 ModelExtractionUtils]: 50 out of 134 variables were initially zero. Simplification set additionally 81 variables to zero. [2022-07-26 14:17:43,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:43,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:43,854 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:17:43,854 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:17:43,856 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:43,862 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2022-07-26 14:17:43,863 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:43,863 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~start~0, ~n~0) = -1*~start~0 + 1*~n~0 Supporting invariants [] [2022-07-26 14:17:43,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:44,097 INFO L156 tatePredicateManager]: 63 out of 63 supporting invariants were superfluous and have been removed [2022-07-26 14:17:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:44,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:44,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:44,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:17:44,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:44,167 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:17:44,167 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:17:44,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 421 states and 1169 transitions. cyclomatic complexity: 819 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:17:44,202 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 421 states and 1169 transitions. cyclomatic complexity: 819. 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 881 states and 2528 transitions. Complement of second has 4 states. [2022-07-26 14:17:44,202 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:17:44,202 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:17:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-07-26 14:17:44,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-26 14:17:44,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:44,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 14 letters. Loop has 2 letters. [2022-07-26 14:17:44,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:44,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-26 14:17:44,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:44,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 881 states and 2528 transitions. [2022-07-26 14:17:44,209 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:17:44,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 881 states to 0 states and 0 transitions. [2022-07-26 14:17:44,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 14:17:44,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 14:17:44,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 14:17:44,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:44,209 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:17:44,209 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:17:44,209 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:17:44,209 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-26 14:17:44,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 14:17:44,209 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:17:44,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 14:17:44,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:17:44 BoogieIcfgContainer [2022-07-26 14:17:44,214 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:17:44,214 INFO L158 Benchmark]: Toolchain (without parser) took 37669.92ms. Allocated memory was 173.0MB in the beginning and 437.3MB in the end (delta: 264.2MB). Free memory was 113.7MB in the beginning and 259.9MB in the end (delta: -146.2MB). Peak memory consumption was 119.1MB. Max. memory is 8.0GB. [2022-07-26 14:17:44,214 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:17:44,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.75ms. Allocated memory was 173.0MB in the beginning and 233.8MB in the end (delta: 60.8MB). Free memory was 113.5MB in the beginning and 203.1MB in the end (delta: -89.6MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-07-26 14:17:44,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.36ms. Allocated memory is still 233.8MB. Free memory was 202.6MB in the beginning and 200.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:17:44,215 INFO L158 Benchmark]: Boogie Preprocessor took 25.44ms. Allocated memory is still 233.8MB. Free memory was 200.5MB in the beginning and 198.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 14:17:44,215 INFO L158 Benchmark]: RCFGBuilder took 534.99ms. Allocated memory is still 233.8MB. Free memory was 198.9MB in the beginning and 175.3MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-07-26 14:17:44,215 INFO L158 Benchmark]: BuchiAutomizer took 36804.60ms. Allocated memory was 233.8MB in the beginning and 437.3MB in the end (delta: 203.4MB). Free memory was 175.3MB in the beginning and 259.9MB in the end (delta: -84.6MB). Peak memory consumption was 119.9MB. Max. memory is 8.0GB. [2022-07-26 14:17:44,216 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 173.0MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.75ms. Allocated memory was 173.0MB in the beginning and 233.8MB in the end (delta: 60.8MB). Free memory was 113.5MB in the beginning and 203.1MB in the end (delta: -89.6MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.36ms. Allocated memory is still 233.8MB. Free memory was 202.6MB in the beginning and 200.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.44ms. Allocated memory is still 233.8MB. Free memory was 200.5MB in the beginning and 198.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 534.99ms. Allocated memory is still 233.8MB. Free memory was 198.9MB in the beginning and 175.3MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 36804.60ms. Allocated memory was 233.8MB in the beginning and 437.3MB in the end (delta: 203.4MB). Free memory was 175.3MB in the beginning and 259.9MB in the end (delta: -84.6MB). Peak memory consumption was 119.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#length-unknown[arr] + -1 * arr + -4 * 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 -1 * end + n and consists of 3 locations. One deterministic module has affine ranking function -2 * start + n and consists of 7 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function n + -1 * start and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.7s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 30.8s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 390 StatesRemovedByMinimization, 8 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 [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 848 IncrementalHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 7 mSDtfsCounter, 848 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU1 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital427 mio100 ax106 hnf100 lsp85 ukn69 mio100 lsp44 div129 bol100 ite100 ukn100 eq170 hnf93 smp80 dnf140 smp91 tf100 neg99 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 146ms VariablesStem: 12 VariablesLoop: 13 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 4.1s - 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.0s, 173 PlacesBefore, 26 PlacesAfterwards, 181 TransitionsBefore, 24 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 132 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 6 ConcurrentYvCompositions, 10 ChoiceCompositions, 194 TotalNumberOfCompositions, 1324 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 972, positive: 898, positive conditional: 0, positive unconditional: 898, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 391, positive: 375, positive conditional: 0, positive unconditional: 375, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 972, positive: 523, positive conditional: 0, positive unconditional: 523, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 391, unknown conditional: 0, unknown unconditional: 391] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 RESULT: Ultimate proved your program to be correct! [2022-07-26 14:17:44,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:44,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:44,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...