/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-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:17:00,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:17:00,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:17:00,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:17:00,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:17:00,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:17:00,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:17:00,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:17:00,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:17:00,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:17:00,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:17:00,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:17:00,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:17:00,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:17:00,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:17:00,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:17:00,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:17:00,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:17:00,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:17:00,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:17:00,737 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:17:00,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:17:00,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:17:00,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:17:00,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:17:00,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:17:00,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:17:00,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:17:00,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:17:00,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:17:00,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:17:00,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:17:00,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:17:00,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:17:00,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:17:00,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:17:00,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:17:00,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:17:00,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:17:00,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:17:00,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:17:00,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:17:00,751 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:00,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:17:00,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:17:00,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:17:00,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:17:00,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:17:00,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:17:00,775 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:17:00,775 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:17:00,775 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:17:00,775 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:17:00,775 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:17:00,775 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:17:00,776 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:17:00,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:17:00,776 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:17:00,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:17:00,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:17:00,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:17:00,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:17:00,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:17:00,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:17:00,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:17:00,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:17:00,778 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:17:00,779 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:17:00,779 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:00,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:17:00,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:17:00,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:17:00,970 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:17:00,970 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:17:00,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-07-26 14:17:01,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1c09ab2/590c4ff6a089414aad56e0ceb549d0fb/FLAG971a70a9b [2022-07-26 14:17:01,386 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:17:01,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-07-26 14:17:01,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1c09ab2/590c4ff6a089414aad56e0ceb549d0fb/FLAG971a70a9b [2022-07-26 14:17:01,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1c09ab2/590c4ff6a089414aad56e0ceb549d0fb [2022-07-26 14:17:01,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:17:01,402 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:17:01,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:17:01,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:17:01,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:17:01,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:17:01" (1/1) ... [2022-07-26 14:17:01,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9a95fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:01, skipping insertion in model container [2022-07-26 14:17:01,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:17:01" (1/1) ... [2022-07-26 14:17:01,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:17:01,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:17:01,570 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-dec-subseq.wvr.c[2924,2937] [2022-07-26 14:17:01,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:17:01,587 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:17:01,610 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-dec-subseq.wvr.c[2924,2937] [2022-07-26 14:17:01,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:17:01,621 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:17:01,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:01 WrapperNode [2022-07-26 14:17:01,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:17:01,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:17:01,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:17:01,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:17:01,627 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:01" (1/1) ... [2022-07-26 14:17:01,633 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:01" (1/1) ... [2022-07-26 14:17:01,659 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 186 [2022-07-26 14:17:01,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:17:01,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:17:01,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:17:01,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:17:01,666 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:01" (1/1) ... [2022-07-26 14:17:01,666 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:01" (1/1) ... [2022-07-26 14:17:01,669 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:01" (1/1) ... [2022-07-26 14:17:01,669 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:01" (1/1) ... [2022-07-26 14:17:01,682 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:01" (1/1) ... [2022-07-26 14:17:01,685 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:01" (1/1) ... [2022-07-26 14:17:01,686 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:01" (1/1) ... [2022-07-26 14:17:01,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:17:01,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:17:01,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:17:01,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:17:01,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:01" (1/1) ... [2022-07-26 14:17:01,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:01,735 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:01,740 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:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:17:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:17:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:17:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:17:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:17:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:17:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:17:01,761 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:01,860 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:17:01,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:17:02,186 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:17:02,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:17:02,239 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-26 14:17:02,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:17:02 BoogieIcfgContainer [2022-07-26 14:17:02,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:17:02,242 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:17:02,242 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:17:02,244 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:17:02,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:17:02,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:17:01" (1/3) ... [2022-07-26 14:17:02,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3be7146e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:17:02, skipping insertion in model container [2022-07-26 14:17:02,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:17:02,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:17:01" (2/3) ... [2022-07-26 14:17:02,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3be7146e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:17:02, skipping insertion in model container [2022-07-26 14:17:02,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:17:02,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:17:02" (3/3) ... [2022-07-26 14:17:02,247 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-07-26 14:17:02,313 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:17:02,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 185 transitions, 386 flow [2022-07-26 14:17:02,372 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-26 14:17:02,372 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:17:02,375 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:02,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 185 transitions, 386 flow [2022-07-26 14:17:02,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 374 flow [2022-07-26 14:17:02,383 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:17:02,389 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-26 14:17:02,391 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-26 14:17:02,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 374 flow [2022-07-26 14:17:02,411 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-26 14:17:02,427 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:17:02,428 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:02,429 INFO L116 LiptonReduction]: Number of co-enabled transitions 690 [2022-07-26 14:17:06,872 INFO L131 LiptonReduction]: Checked pairs total: 1324 [2022-07-26 14:17:06,873 INFO L133 LiptonReduction]: Total number of compositions: 194 [2022-07-26 14:17:06,884 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:17:06,885 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:17:06,885 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:17:06,885 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:17:06,885 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:17:06,885 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:17:06,885 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:17:06,885 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:17:06,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:17:06,918 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-07-26 14:17:06,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:06,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:06,924 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:17:06,924 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:17:06,924 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:17:06,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 73 states, but on-demand construction may add more states [2022-07-26 14:17:06,935 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-07-26 14:17:06,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:06,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:06,936 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:17:06,936 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:17:06,941 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:06,941 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:06,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:06,946 INFO L85 PathProgramCache]: Analyzing trace with hash 772, now seen corresponding path program 1 times [2022-07-26 14:17:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:06,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46351334] [2022-07-26 14:17:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:07,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:07,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash 734, now seen corresponding path program 1 times [2022-07-26 14:17:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691699835] [2022-07-26 14:17:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:07,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:07,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash 24635, now seen corresponding path program 1 times [2022-07-26 14:17:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:07,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817736562] [2022-07-26 14:17:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:07,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:07,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:07,697 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:07,698 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:07,698 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:07,698 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:07,698 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:07,698 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:07,698 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:07,698 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:07,698 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:17:07,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:07,699 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:07,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:07,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:07,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:07,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:07,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:07,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:07,725 INFO L142 MapEliminator]: 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:07,919 INFO L142 MapEliminator]: 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:07,922 INFO L142 MapEliminator]: 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:07,924 INFO L142 MapEliminator]: 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:07,925 INFO L142 MapEliminator]: 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:07,927 INFO L142 MapEliminator]: 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:07,928 INFO L142 MapEliminator]: 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:07,929 INFO L142 MapEliminator]: 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:07,931 INFO L142 MapEliminator]: 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:07,934 INFO L142 MapEliminator]: 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:07,935 INFO L142 MapEliminator]: 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:07,936 INFO L142 MapEliminator]: 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:07,938 INFO L142 MapEliminator]: 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:07,941 INFO L142 MapEliminator]: 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:07,942 INFO L142 MapEliminator]: 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:07,944 INFO L142 MapEliminator]: 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:07,946 INFO L142 MapEliminator]: 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:07,948 INFO L142 MapEliminator]: 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:07,949 INFO L142 MapEliminator]: 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:07,951 INFO L142 MapEliminator]: 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:07,952 INFO L142 MapEliminator]: 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:07,954 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:07,956 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:07,958 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:07,959 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:07,961 INFO L142 MapEliminator]: 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:07,963 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:07,964 INFO L142 MapEliminator]: 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:07,966 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:07,967 INFO L142 MapEliminator]: 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:07,969 INFO L142 MapEliminator]: 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:07,972 INFO L142 MapEliminator]: 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:07,973 INFO L142 MapEliminator]: 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:07,974 INFO L142 MapEliminator]: 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:07,976 INFO L142 MapEliminator]: 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:08,342 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:08,345 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,347 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:08,350 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:08,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:08,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:08,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,388 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:08,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,389 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:08,392 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:08,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:08,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:08,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:08,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:08,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,426 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:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,427 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:08,427 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:08,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:08,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:08,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:08,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:08,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,468 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:08,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,469 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:08,474 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:08,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:08,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:08,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,510 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:08,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,512 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:08,512 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:08,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:08,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:08,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:08,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:08,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,535 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:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,536 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:08,537 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:08,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:08,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:08,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,573 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:08,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,574 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:08,575 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:08,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:08,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,581 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 14:17:08,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,592 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 14:17:08,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,638 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:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,641 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:08,643 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:08,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:08,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:08,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,692 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:08,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,694 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:08,695 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:08,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:08,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:08,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,736 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:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,737 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:08,738 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:08,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:08,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:08,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:08,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,810 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:08,811 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:08,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:08,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:08,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,853 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:08,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,854 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:08,855 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:08,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:08,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:08,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:08,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:08,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:08,877 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:08,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,878 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:08,879 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:08,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:08,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:08,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:08,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:08,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:08,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:08,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:08,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:08,915 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-26 14:17:08,916 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-26 14:17:08,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:08,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:08,918 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:08,919 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:08,920 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:08,941 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:17:08,942 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:08,942 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~1#1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~1#1 Supporting invariants [] [2022-07-26 14:17:08,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:09,019 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-26 14:17:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:09,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:09,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:09,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:17:09,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:09,059 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:09,076 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:09,077 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:09,129 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:09,143 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:09,146 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:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-26 14:17:09,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:17:09,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:09,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:17:09,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:09,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:17:09,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:09,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 182 transitions. [2022-07-26 14:17:09,151 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 59 [2022-07-26 14:17:09,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 70 states and 171 transitions. [2022-07-26 14:17:09,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-26 14:17:09,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2022-07-26 14:17:09,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 171 transitions. [2022-07-26 14:17:09,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:09,160 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-26 14:17:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 171 transitions. [2022-07-26 14:17:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-07-26 14:17:09,178 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:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 169 transitions. [2022-07-26 14:17:09,180 INFO L242 hiAutomatonCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-07-26 14:17:09,180 INFO L426 stractBuchiCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-07-26 14:17:09,180 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:17:09,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 169 transitions. [2022-07-26 14:17:09,181 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 59 [2022-07-26 14:17:09,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:09,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:09,181 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-26 14:17:09,181 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:17:09,182 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:09,183 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:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash 24670, now seen corresponding path program 1 times [2022-07-26 14:17:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:09,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868507759] [2022-07-26 14:17:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:09,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:09,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash 726, now seen corresponding path program 1 times [2022-07-26 14:17:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:09,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064454141] [2022-07-26 14:17:09,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:09,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:09,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:09,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash 765465, now seen corresponding path program 1 times [2022-07-26 14:17:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:09,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054242926] [2022-07-26 14:17:09,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:09,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:09,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:09,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:10,332 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:10,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:10,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:10,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:10,332 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:10,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:10,333 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:10,333 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:10,333 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration2_Lasso [2022-07-26 14:17:10,333 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:10,333 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:10,335 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:10,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:10,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:10,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:10,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:10,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:10,367 INFO L142 MapEliminator]: 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:10,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:10,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:10,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:10,374 INFO L142 MapEliminator]: 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:10,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:10,377 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:10,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:10,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:10,381 INFO L142 MapEliminator]: 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:10,382 INFO L142 MapEliminator]: 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:10,384 INFO L142 MapEliminator]: 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:10,385 INFO L142 MapEliminator]: 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:10,386 INFO L142 MapEliminator]: 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:10,388 INFO L142 MapEliminator]: 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:10,389 INFO L142 MapEliminator]: 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:10,390 INFO L142 MapEliminator]: 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:10,394 INFO L142 MapEliminator]: 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:10,395 INFO L142 MapEliminator]: 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:10,396 INFO L142 MapEliminator]: 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:10,397 INFO L142 MapEliminator]: 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:10,399 INFO L142 MapEliminator]: 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:10,400 INFO L142 MapEliminator]: 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:10,534 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:10,725 INFO L142 MapEliminator]: 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:10,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:10,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:10,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:10,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:10,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:10,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:10,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:10,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:10,740 INFO L142 MapEliminator]: 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:11,162 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:11,163 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:11,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,188 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:11,190 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:11,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:11,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,232 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:11,259 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:11,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-26 14:17:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,287 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:11,287 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:11,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:11,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-26 14:17:11,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,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:11,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:11,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:11,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,362 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:11,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,363 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:11,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,390 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:11,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,416 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:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,417 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:11,418 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:11,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,461 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:11,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,463 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:11,463 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:11,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,487 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:11,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,488 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:11,489 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:11,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,522 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:11,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,523 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:11,524 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:11,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:11,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,549 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:11,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,550 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:11,551 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:11,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:11,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,574 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:11,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,575 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:11,576 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:11,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,602 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:11,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,603 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:11,605 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:11,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:11,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,628 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:11,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,629 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:11,630 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:11,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,667 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:11,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,668 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:11,669 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:11,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,694 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:11,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,695 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:11,695 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:11,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:11,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,720 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:11,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,721 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:11,722 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:11,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:11,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,745 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:11,746 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:11,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:11,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-26 14:17:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,783 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:11,784 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:11,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:11,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-26 14:17:11,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,810 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:11,811 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:11,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,835 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:11,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,836 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:11,836 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:11,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,861 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:11,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,863 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:11,864 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:11,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:11,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,886 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:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,888 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:11,888 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:11,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:11,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:11,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:11,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:11,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:11,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,914 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:11,914 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:11,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:11,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:11,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:11,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:11,951 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:11,956 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:11,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:11,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:11,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:11,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:11,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:11,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:11,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:11,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,004 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:12,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,005 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:12,008 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:12,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:12,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:12,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:12,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,029 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:12,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,030 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:12,031 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:12,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:12,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:12,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:12,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:12,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,054 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:12,055 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:12,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,082 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:12,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,083 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:12,083 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:12,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:12,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:12,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:12,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,114 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:12,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,115 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:12,115 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:12,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,141 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:12,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,142 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:12,143 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:12,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:12,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,168 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:12,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,169 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:12,170 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:12,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,196 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:12,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,197 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:12,198 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:12,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,222 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:12,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,223 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:12,223 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:12,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,247 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:12,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,248 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:12,249 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:12,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:12,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,274 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:12,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,275 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:12,276 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:12,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:12,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:12,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,316 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:12,317 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:12,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:12,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,324 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:17:12,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,327 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:17:12,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,360 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:12,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,361 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:12,362 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:12,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:12,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:12,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,402 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:12,403 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:12,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:12,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:12,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:12,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:12,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:12,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:12,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:12,420 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:12,435 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 14:17:12,435 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-26 14:17:12,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:12,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:12,436 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:12,437 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:12,438 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:12,443 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:17:12,443 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:12,443 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:12,459 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:12,504 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-26 14:17:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:12,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:12,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:12,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:17:12,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:12,543 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:12,543 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:12,544 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:12,595 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:12,595 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:12,596 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:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-07-26 14:17:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:17:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-26 14:17:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-26 14:17:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:12,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 335 transitions. [2022-07-26 14:17:12,602 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:12,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 70 states and 171 transitions. [2022-07-26 14:17:12,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-26 14:17:12,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-26 14:17:12,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 171 transitions. [2022-07-26 14:17:12,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:12,607 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-26 14:17:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 171 transitions. [2022-07-26 14:17:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-26 14:17:12,617 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:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 171 transitions. [2022-07-26 14:17:12,618 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-26 14:17:12,618 INFO L426 stractBuchiCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-26 14:17:12,618 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:17:12,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 171 transitions. [2022-07-26 14:17:12,620 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:12,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:12,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:12,621 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:17:12,621 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:12,622 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:12,622 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) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_23| v_~last~0_16)) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31)))) 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:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash 23731352, now seen corresponding path program 1 times [2022-07-26 14:17:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:12,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334220891] [2022-07-26 14:17:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:12,746 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:12,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:12,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334220891] [2022-07-26 14:17:12,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334220891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:12,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:12,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:17:12,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819882195] [2022-07-26 14:17:12,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:12,749 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:17:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 1 times [2022-07-26 14:17:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:12,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566415931] [2022-07-26 14:17:12,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:12,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:12,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:12,772 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:12,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:12,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:17:12,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:17:12,791 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:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:12,831 INFO L93 Difference]: Finished difference Result 70 states and 170 transitions. [2022-07-26 14:17:12,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 170 transitions. [2022-07-26 14:17:12,832 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:12,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 170 transitions. [2022-07-26 14:17:12,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-26 14:17:12,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-26 14:17:12,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 170 transitions. [2022-07-26 14:17:12,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:12,833 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-26 14:17:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 170 transitions. [2022-07-26 14:17:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-26 14:17:12,835 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:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 170 transitions. [2022-07-26 14:17:12,836 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-26 14:17:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:17:12,837 INFO L426 stractBuchiCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-26 14:17:12,837 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:17:12,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 170 transitions. [2022-07-26 14:17:12,838 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:12,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:12,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:12,838 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:17:12,838 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:12,839 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:12,839 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) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_23| v_~last~0_16)) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31)))) 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:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash 735635347, now seen corresponding path program 1 times [2022-07-26 14:17:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:12,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075450487] [2022-07-26 14:17:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:12,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:12,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:12,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 2 times [2022-07-26 14:17:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:12,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830810316] [2022-07-26 14:17:12,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:12,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:12,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1724014598, now seen corresponding path program 1 times [2022-07-26 14:17:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:12,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119284349] [2022-07-26 14:17:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:12,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:12,931 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:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:12,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119284349] [2022-07-26 14:17:12,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119284349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:12,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:12,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 14:17:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843669980] [2022-07-26 14:17:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:17:12,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:17:12,954 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:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:13,048 INFO L93 Difference]: Finished difference Result 133 states and 328 transitions. [2022-07-26 14:17:13,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 328 transitions. [2022-07-26 14:17:13,051 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 86 [2022-07-26 14:17:13,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 328 transitions. [2022-07-26 14:17:13,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2022-07-26 14:17:13,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2022-07-26 14:17:13,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 328 transitions. [2022-07-26 14:17:13,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:13,058 INFO L220 hiAutomatonCegarLoop]: Abstraction has 133 states and 328 transitions. [2022-07-26 14:17:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 328 transitions. [2022-07-26 14:17:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 71. [2022-07-26 14:17:13,071 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:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 173 transitions. [2022-07-26 14:17:13,072 INFO L242 hiAutomatonCegarLoop]: Abstraction has 71 states and 173 transitions. [2022-07-26 14:17:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:17:13,073 INFO L426 stractBuchiCegarLoop]: Abstraction has 71 states and 173 transitions. [2022-07-26 14:17:13,073 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:17:13,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 173 transitions. [2022-07-26 14:17:13,073 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-26 14:17:13,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:13,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:13,073 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:17:13,074 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:13,075 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:13,075 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) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_23| v_~last~0_16)) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31)))) 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#[L102-3, 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] 1386#[L102-3, L59]don't care [2022-07-26 14:17:13,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1329859971, now seen corresponding path program 1 times [2022-07-26 14:17:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084004330] [2022-07-26 14:17:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,104 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 3 times [2022-07-26 14:17:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271786074] [2022-07-26 14:17:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1904801302, now seen corresponding path program 1 times [2022-07-26 14:17:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131322796] [2022-07-26 14:17:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:13,223 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:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:13,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131322796] [2022-07-26 14:17:13,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131322796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:13,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:13,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-26 14:17:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033941131] [2022-07-26 14:17:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:13,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:13,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-26 14:17:13,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-26 14:17:13,248 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:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:13,343 INFO L93 Difference]: Finished difference Result 124 states and 297 transitions. [2022-07-26 14:17:13,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 297 transitions. [2022-07-26 14:17:13,344 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 82 [2022-07-26 14:17:13,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 297 transitions. [2022-07-26 14:17:13,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-07-26 14:17:13,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-07-26 14:17:13,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 297 transitions. [2022-07-26 14:17:13,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:13,345 INFO L220 hiAutomatonCegarLoop]: Abstraction has 124 states and 297 transitions. [2022-07-26 14:17:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 297 transitions. [2022-07-26 14:17:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 80. [2022-07-26 14:17:13,347 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:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 202 transitions. [2022-07-26 14:17:13,347 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 202 transitions. [2022-07-26 14:17:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:17:13,348 INFO L426 stractBuchiCegarLoop]: Abstraction has 80 states and 202 transitions. [2022-07-26 14:17:13,348 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:17:13,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 202 transitions. [2022-07-26 14:17:13,349 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-26 14:17:13,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:13,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:13,349 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:17:13,349 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:17:13,350 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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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#[L101-4, L49-2]don't care [2022-07-26 14:17:13,350 INFO L735 eck$LassoCheckResult]: Loop: 1669#[L101-4, L49-2]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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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#[L101-4, L49-2]don't care [2022-07-26 14:17:13,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1329859928, now seen corresponding path program 1 times [2022-07-26 14:17:13,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649453384] [2022-07-26 14:17:13,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 1 times [2022-07-26 14:17:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905534249] [2022-07-26 14:17:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash -899042998, now seen corresponding path program 1 times [2022-07-26 14:17:13,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159467478] [2022-07-26 14:17:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:13,462 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:13,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:13,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159467478] [2022-07-26 14:17:13,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159467478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:13,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:13,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:17:13,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182790085] [2022-07-26 14:17:13,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:13,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:17:13,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:17:13,600 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:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:13,644 INFO L93 Difference]: Finished difference Result 109 states and 250 transitions. [2022-07-26 14:17:13,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 250 transitions. [2022-07-26 14:17:13,645 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-26 14:17:13,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 80 states and 201 transitions. [2022-07-26 14:17:13,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-26 14:17:13,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-26 14:17:13,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 201 transitions. [2022-07-26 14:17:13,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:13,646 INFO L220 hiAutomatonCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-26 14:17:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 201 transitions. [2022-07-26 14:17:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-26 14:17:13,647 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:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 201 transitions. [2022-07-26 14:17:13,648 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-26 14:17:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:17:13,652 INFO L426 stractBuchiCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-26 14:17:13,652 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 14:17:13,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 201 transitions. [2022-07-26 14:17:13,652 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-26 14:17:13,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:13,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:13,652 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:13,653 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:17:13,653 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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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#[L101-4, L49-2]don't care [2022-07-26 14:17:13,653 INFO L735 eck$LassoCheckResult]: Loop: 1947#[L101-4, L49-2]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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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#[L101-4, L49-2]don't care [2022-07-26 14:17:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1607490177, now seen corresponding path program 1 times [2022-07-26 14:17:13,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916249596] [2022-07-26 14:17:13,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:13,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 2 times [2022-07-26 14:17:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682158948] [2022-07-26 14:17:13,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:13,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -196525581, now seen corresponding path program 1 times [2022-07-26 14:17:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844691261] [2022-07-26 14:17:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:13,768 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:13,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:13,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844691261] [2022-07-26 14:17:13,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844691261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:17:13,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529908732] [2022-07-26 14:17:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:13,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:17:13,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:13,769 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:13,770 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:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:13,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:17:13,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:13,890 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:13,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:17:13,969 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:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529908732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:17:13,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:17:13,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-07-26 14:17:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940297254] [2022-07-26 14:17:13,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:17:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-26 14:17:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-26 14:17:14,106 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:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:14,371 INFO L93 Difference]: Finished difference Result 205 states and 473 transitions. [2022-07-26 14:17:14,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 473 transitions. [2022-07-26 14:17:14,372 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 118 [2022-07-26 14:17:14,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 195 states and 450 transitions. [2022-07-26 14:17:14,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2022-07-26 14:17:14,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2022-07-26 14:17:14,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 450 transitions. [2022-07-26 14:17:14,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:14,374 INFO L220 hiAutomatonCegarLoop]: Abstraction has 195 states and 450 transitions. [2022-07-26 14:17:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 450 transitions. [2022-07-26 14:17:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2022-07-26 14:17:14,377 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:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 307 transitions. [2022-07-26 14:17:14,377 INFO L242 hiAutomatonCegarLoop]: Abstraction has 122 states and 307 transitions. [2022-07-26 14:17:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-26 14:17:14,380 INFO L426 stractBuchiCegarLoop]: Abstraction has 122 states and 307 transitions. [2022-07-26 14:17:14,380 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-26 14:17:14,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 307 transitions. [2022-07-26 14:17:14,380 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 82 [2022-07-26 14:17:14,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:14,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:14,381 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:14,381 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:17:14,381 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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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#[L101-4, L49-2]don't care [2022-07-26 14:17:14,381 INFO L735 eck$LassoCheckResult]: Loop: 2551#[L101-4, L49-2]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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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#[L101-4, L49-2]don't care [2022-07-26 14:17:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1708565110, now seen corresponding path program 2 times [2022-07-26 14:17:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:14,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873174581] [2022-07-26 14:17:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:14,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 3 times [2022-07-26 14:17:14,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:14,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917203262] [2022-07-26 14:17:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:14,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2065196932, now seen corresponding path program 2 times [2022-07-26 14:17:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:14,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091888471] [2022-07-26 14:17:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:14,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:16,481 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:16,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:16,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:16,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:16,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:16,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:16,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:16,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:16,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration8_Lasso [2022-07-26 14:17:16,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:16,481 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:16,484 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,486 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,487 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,489 INFO L142 MapEliminator]: 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,490 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,492 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,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:16,496 INFO L142 MapEliminator]: 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,498 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,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:16,503 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,505 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,507 INFO L142 MapEliminator]: 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,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:16,512 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,514 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,516 INFO L142 MapEliminator]: 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,518 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:16,520 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:17,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:17,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:17,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:17,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:17,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:17,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:17,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:17,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:17,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:17,725 INFO L142 MapEliminator]: 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:17,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:17,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:17,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:17,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:17,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:17,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:17,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:17,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:17,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:18,354 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:18,354 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:18,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,355 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:18,356 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:18,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:18,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,395 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:18,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,396 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:18,397 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:18,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:18,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:18,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,420 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:18,431 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:18,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:18,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,466 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:18,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,467 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:18,467 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:18,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:18,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,490 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:18,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,491 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:18,491 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:18,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:18,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,542 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:18,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,543 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:18,543 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:18,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-26 14:17:18,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,582 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:18,583 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:18,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:18,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:18,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,608 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:18,608 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:18,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-26 14:17:18,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,635 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:18,636 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:18,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-26 14:17:18,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,659 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:18,660 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:18,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:18,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,683 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:18,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,684 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:18,685 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:18,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:18,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,710 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:18,714 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:18,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,736 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:18,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,737 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:18,737 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:18,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,771 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:18,772 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:18,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:18,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-26 14:17:18,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,797 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:18,798 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:18,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:18,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:18,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,822 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:18,822 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:18,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,846 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:18,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,847 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:18,848 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:18,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-26 14:17:18,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,874 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:18,874 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:18,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:18,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:18,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:18,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,897 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:18,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,898 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:18,898 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:18,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:18,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,936 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:18,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,937 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:18,937 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:18,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:18,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-26 14:17:18,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,963 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:18,964 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:18,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:18,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:18,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:18,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:18,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:18,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:18,991 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:18,991 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:18,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:18,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:18,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:18,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:18,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:18,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:18,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-26 14:17:19,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,017 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:19,017 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:19,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,057 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:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,059 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:19,059 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:19,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,096 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:19,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,097 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:19,097 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:19,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:19,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,121 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:19,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,122 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:19,123 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:19,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:19,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,147 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:19,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,148 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:19,149 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:19,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,184 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:19,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,185 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:19,186 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:19,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:19,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-26 14:17:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,218 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:19,218 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:19,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,243 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:19,243 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:19,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,267 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:19,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,268 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:19,269 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:19,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:19,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-26 14:17:19,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,293 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:19,293 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:19,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,300 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:17:19,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,305 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:17:19,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:19,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,328 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:19,328 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:19,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,352 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:19,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,353 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:19,354 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:19,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:19,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,377 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:19,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,378 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:19,378 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:19,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-26 14:17:19,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,403 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:19,404 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:19,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:19,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:19,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-26 14:17:19,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,429 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:19,429 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:19,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:19,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:19,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:19,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:19,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:19,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:19,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:19,463 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:19,489 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-26 14:17:19,489 INFO L444 ModelExtractionUtils]: 18 out of 52 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-07-26 14:17:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:19,490 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:19,491 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:19,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:19,512 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:17:19,513 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:19,513 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:19,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-26 14:17:19,751 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:19,759 INFO L156 tatePredicateManager]: 50 out of 50 supporting invariants were superfluous and have been removed [2022-07-26 14:17:19,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:19,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:19,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:19,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:17:19,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:19,833 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:19,833 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:19,833 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:19,884 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:19,885 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:19,886 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:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-07-26 14:17:19,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-26 14:17:19,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:19,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-26 14:17:19,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:19,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 8 letters. Loop has 8 letters. [2022-07-26 14:17:19,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:19,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 788 transitions. [2022-07-26 14:17:19,889 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 72 [2022-07-26 14:17:19,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 266 states and 672 transitions. [2022-07-26 14:17:19,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-07-26 14:17:19,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2022-07-26 14:17:19,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 672 transitions. [2022-07-26 14:17:19,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:17:19,891 INFO L220 hiAutomatonCegarLoop]: Abstraction has 266 states and 672 transitions. [2022-07-26 14:17:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 672 transitions. [2022-07-26 14:17:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 195. [2022-07-26 14:17:19,894 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:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 529 transitions. [2022-07-26 14:17:19,895 INFO L242 hiAutomatonCegarLoop]: Abstraction has 195 states and 529 transitions. [2022-07-26 14:17:19,895 INFO L426 stractBuchiCegarLoop]: Abstraction has 195 states and 529 transitions. [2022-07-26 14:17:19,895 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-26 14:17:19,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 529 transitions. [2022-07-26 14:17:19,896 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 60 [2022-07-26 14:17:19,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:19,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:19,896 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:19,896 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:19,896 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#[thread2ENTRY, L102-4, L59]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:19,897 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)) (<= 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)) (= (ite (= 0 (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~new~0_27 v_~v_old~0_16)) 1 0)) 0 1) v_~ok~0_16) (= |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#[L102-4, L59, L76]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:19,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1390107715, now seen corresponding path program 1 times [2022-07-26 14:17:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:19,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694097374] [2022-07-26 14:17:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 1 times [2022-07-26 14:17:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:19,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585817853] [2022-07-26 14:17:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:19,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:19,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -158664463, now seen corresponding path program 1 times [2022-07-26 14:17:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:19,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239051809] [2022-07-26 14:17:19,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:19,993 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:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:17:19,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239051809] [2022-07-26 14:17:19,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239051809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:17:19,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:17:19,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:17:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962875486] [2022-07-26 14:17:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:17:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:17:20,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:17:20,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:17:20,120 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:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:17:20,157 INFO L93 Difference]: Finished difference Result 207 states and 512 transitions. [2022-07-26 14:17:20,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 512 transitions. [2022-07-26 14:17:20,158 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 52 [2022-07-26 14:17:20,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 192 states and 471 transitions. [2022-07-26 14:17:20,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2022-07-26 14:17:20,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2022-07-26 14:17:20,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 471 transitions. [2022-07-26 14:17:20,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:17:20,160 INFO L220 hiAutomatonCegarLoop]: Abstraction has 192 states and 471 transitions. [2022-07-26 14:17:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 471 transitions. [2022-07-26 14:17:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 185. [2022-07-26 14:17:20,162 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:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 458 transitions. [2022-07-26 14:17:20,163 INFO L242 hiAutomatonCegarLoop]: Abstraction has 185 states and 458 transitions. [2022-07-26 14:17:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:17:20,164 INFO L426 stractBuchiCegarLoop]: Abstraction has 185 states and 458 transitions. [2022-07-26 14:17:20,165 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-26 14:17:20,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 458 transitions. [2022-07-26 14:17:20,165 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 52 [2022-07-26 14:17:20,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:20,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:20,166 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:20,166 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:20,166 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#[thread2ENTRY, L102-4, L59]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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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#[L79, L49-2, 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, L54, L102-4]don't care [2022-07-26 14:17:20,166 INFO L735 eck$LassoCheckResult]: Loop: 3800#[L79, L54, 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)) (<= 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)) (= (ite (= 0 (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~new~0_27 v_~v_old~0_16)) 1 0)) 0 1) v_~ok~0_16) (= |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#[L54, L102-4, L76]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, L54, L102-4]don't care [2022-07-26 14:17:20,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash -158664272, now seen corresponding path program 1 times [2022-07-26 14:17:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:20,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436699584] [2022-07-26 14:17:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:20,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:20,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 2 times [2022-07-26 14:17:20,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:20,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966017044] [2022-07-26 14:17:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:20,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:20,204 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:20,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2142477860, now seen corresponding path program 1 times [2022-07-26 14:17:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:20,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708168675] [2022-07-26 14:17:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:20,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:20,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:22,647 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:22,648 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:22,648 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:22,648 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:22,648 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:22,648 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:22,648 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:22,648 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:22,648 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration10_Lasso [2022-07-26 14:17:22,648 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:22,648 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:22,651 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,653 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,654 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,656 INFO L142 MapEliminator]: 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,657 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,659 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,661 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,662 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,663 INFO L142 MapEliminator]: 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,665 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,667 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,668 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,670 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,672 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,674 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:22,676 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:24,028 INFO L142 MapEliminator]: 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:24,030 INFO L142 MapEliminator]: 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:24,031 INFO L142 MapEliminator]: 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:24,032 INFO L142 MapEliminator]: 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:24,033 INFO L142 MapEliminator]: 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:24,036 INFO L142 MapEliminator]: 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:24,039 INFO L142 MapEliminator]: 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:24,041 INFO L142 MapEliminator]: 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:24,044 INFO L142 MapEliminator]: 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:24,047 INFO L142 MapEliminator]: 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:24,048 INFO L142 MapEliminator]: 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:24,049 INFO L142 MapEliminator]: 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:24,051 INFO L142 MapEliminator]: 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:24,052 INFO L142 MapEliminator]: 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:24,053 INFO L142 MapEliminator]: 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:24,054 INFO L142 MapEliminator]: 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:24,056 INFO L142 MapEliminator]: 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:24,057 INFO L142 MapEliminator]: 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:24,058 INFO L142 MapEliminator]: 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:24,059 INFO L142 MapEliminator]: 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:24,060 INFO L142 MapEliminator]: 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:24,062 INFO L142 MapEliminator]: 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:24,063 INFO L142 MapEliminator]: 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:24,064 INFO L142 MapEliminator]: 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:24,065 INFO L142 MapEliminator]: 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:24,066 INFO L142 MapEliminator]: 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:24,067 INFO L142 MapEliminator]: 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:25,391 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:25,391 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:25,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,392 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:25,393 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:25,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-26 14:17:25,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,432 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:25,432 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:25,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,454 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:25,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,455 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:25,456 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:25,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-07-26 14:17:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,478 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:25,479 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:25,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-26 14:17:25,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,501 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:25,503 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:25,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:25,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-26 14:17:25,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,537 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:25,537 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:25,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,560 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:25,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,561 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:25,561 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:25,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,584 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:25,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,585 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:25,585 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:25,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:25,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,609 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:25,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,610 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:25,611 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:25,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:25,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:25,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,643 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:25,644 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:25,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:25,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:25,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,666 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:25,666 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:25,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,688 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:25,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,689 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:25,689 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:25,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:25,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,711 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:25,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,712 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:25,712 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:25,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,735 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:25,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,736 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:25,737 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:25,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-26 14:17:25,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,761 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:25,761 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:25,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:25,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:25,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:25,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:25,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,783 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:25,784 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:25,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:25,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-07-26 14:17:25,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,812 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:25,812 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:25,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:25,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-26 14:17:25,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,869 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:25,869 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:25,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:25,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,895 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:25,895 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:25,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:25,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,919 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:25,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,920 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:25,920 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:25,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:25,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:25,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:25,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:25,944 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:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:25,946 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:25,946 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:25,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:25,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:25,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:25,952 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-26 14:17:25,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:25,982 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2022-07-26 14:17:25,982 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-07-26 14:17:26,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:26,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-26 14:17:26,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:26,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:26,047 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:26,047 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:26,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:26,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:26,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:26,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:26,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:26,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:26,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:26,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:26,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:26,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:26,072 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:26,072 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:26,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:26,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:26,079 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:17:26,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:26,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:26,084 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:17:26,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:26,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:26,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:26,108 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:26,108 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:26,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:26,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:26,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:26,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:26,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:26,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:26,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:26,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:26,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-26 14:17:26,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:26,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:26,147 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:26,147 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:26,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:26,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:26,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:26,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:26,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:26,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:26,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:26,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:26,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-07-26 14:17:26,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:26,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:26,175 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:26,175 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:26,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:26,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:26,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:26,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:26,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:26,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:26,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:26,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:26,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:26,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:26,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:26,200 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:26,200 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:26,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:26,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:26,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:26,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:26,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:26,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:26,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:26,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:26,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-26 14:17:26,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:26,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:26,225 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:26,225 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:26,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:26,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:26,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:26,232 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 14:17:26,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:26,256 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-26 14:17:26,256 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 14:17:26,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:26,442 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2022-07-26 14:17:26,442 INFO L444 ModelExtractionUtils]: 48 out of 96 variables were initially zero. Simplification set additionally 45 variables to zero. [2022-07-26 14:17:26,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:26,444 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:26,444 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:26,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:26,451 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-07-26 14:17:26,451 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:26,451 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:26,468 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:26,663 INFO L156 tatePredicateManager]: 59 out of 61 supporting invariants were superfluous and have been removed [2022-07-26 14:17:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:26,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-26 14:17:26,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:26,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-26 14:17:26,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:26,861 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:26,861 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:26,861 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:26,972 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:26,973 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:26,973 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:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-07-26 14:17:26,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:17:26,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:26,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-26 14:17:26,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:26,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-26 14:17:26,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:26,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 610 states and 1588 transitions. [2022-07-26 14:17:26,977 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 72 [2022-07-26 14:17:26,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 610 states to 443 states and 1171 transitions. [2022-07-26 14:17:26,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2022-07-26 14:17:26,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2022-07-26 14:17:26,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 443 states and 1171 transitions. [2022-07-26 14:17:26,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:17:26,981 INFO L220 hiAutomatonCegarLoop]: Abstraction has 443 states and 1171 transitions. [2022-07-26 14:17:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states and 1171 transitions. [2022-07-26 14:17:27,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 373. [2022-07-26 14:17:27,017 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:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1003 transitions. [2022-07-26 14:17:27,018 INFO L242 hiAutomatonCegarLoop]: Abstraction has 373 states and 1003 transitions. [2022-07-26 14:17:27,018 INFO L426 stractBuchiCegarLoop]: Abstraction has 373 states and 1003 transitions. [2022-07-26 14:17:27,018 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-26 14:17:27,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 1003 transitions. [2022-07-26 14:17:27,020 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 68 [2022-07-26 14:17:27,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:27,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:27,020 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:27,020 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:27,021 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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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#[L101-4, L49-2]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:27,021 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) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_23| v_~last~0_16)) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31)))) 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:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash -205166609, now seen corresponding path program 3 times [2022-07-26 14:17:27,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:27,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882911675] [2022-07-26 14:17:27,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:27,043 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:27,044 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:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:27,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 4 times [2022-07-26 14:17:27,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:27,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065681608] [2022-07-26 14:17:27,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:27,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:27,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash 403405142, now seen corresponding path program 1 times [2022-07-26 14:17:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:27,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840441304] [2022-07-26 14:17:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:27,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:27,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:29,161 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:29,161 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:29,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:29,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:29,161 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:29,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:29,161 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:29,161 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:29,161 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration11_Lasso [2022-07-26 14:17:29,161 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:29,161 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:29,163 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,967 INFO L142 MapEliminator]: 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,968 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:29,970 INFO L142 MapEliminator]: 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,972 INFO L142 MapEliminator]: 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,973 INFO L142 MapEliminator]: 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,975 INFO L142 MapEliminator]: 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,988 INFO L142 MapEliminator]: 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,989 INFO L142 MapEliminator]: 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,990 INFO L142 MapEliminator]: 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,991 INFO L142 MapEliminator]: 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,993 INFO L142 MapEliminator]: 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,994 INFO L142 MapEliminator]: 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,996 INFO L142 MapEliminator]: 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,997 INFO L142 MapEliminator]: 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,998 INFO L142 MapEliminator]: 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,000 INFO L142 MapEliminator]: 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,001 INFO L142 MapEliminator]: 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,002 INFO L142 MapEliminator]: 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,005 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:30,007 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:30,008 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:30,009 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:30,010 INFO L142 MapEliminator]: 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,012 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:30,013 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:30,014 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:30,015 INFO L142 MapEliminator]: 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,016 INFO L142 MapEliminator]: 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,018 INFO L142 MapEliminator]: 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,023 INFO L142 MapEliminator]: 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,029 INFO L142 MapEliminator]: 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,041 INFO L142 MapEliminator]: 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,043 INFO L142 MapEliminator]: 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,044 INFO L142 MapEliminator]: 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,045 INFO L142 MapEliminator]: 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,048 INFO L142 MapEliminator]: 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,049 INFO L142 MapEliminator]: 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,051 INFO L142 MapEliminator]: 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,629 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:30,629 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:30,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,630 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:30,630 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:30,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,656 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:30,656 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:30,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,680 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:30,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,681 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:30,681 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:30,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,705 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:30,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,706 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:30,706 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:30,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,730 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:30,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,731 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:30,732 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:30,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:30,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:30,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,757 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:30,758 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:30,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:30,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,783 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:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,784 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:30,785 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:30,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:30,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,812 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:30,813 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:30,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:30,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2022-07-26 14:17:30,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,846 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: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 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:30,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [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 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,882 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:30,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,884 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:30,884 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:30,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-07-26 14:17:30,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,910 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:30,910 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:30,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:30,934 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:30,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:30,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:30,935 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:30,936 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:30,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:30,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:30,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:30,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:30,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:30,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:30,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:30,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:31,014 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-26 14:17:31,014 INFO L444 ModelExtractionUtils]: 25 out of 52 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-07-26 14:17:31,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:31,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:31,015 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:31,016 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:31,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:31,028 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:17:31,028 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:31,028 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:31,043 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:31,151 INFO L156 tatePredicateManager]: 48 out of 48 supporting invariants were superfluous and have been removed [2022-07-26 14:17:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:31,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:31,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:31,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:17:31,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:31,211 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:31,212 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:31,212 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:31,268 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:31,268 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:31,268 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:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-07-26 14:17:31,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:17:31,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:31,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-26 14:17:31,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:31,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-26 14:17:31,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:31,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 773 states and 2243 transitions. [2022-07-26 14:17:31,274 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 48 [2022-07-26 14:17:31,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 773 states to 483 states and 1314 transitions. [2022-07-26 14:17:31,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2022-07-26 14:17:31,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2022-07-26 14:17:31,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 1314 transitions. [2022-07-26 14:17:31,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:17:31,278 INFO L220 hiAutomatonCegarLoop]: Abstraction has 483 states and 1314 transitions. [2022-07-26 14:17:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 1314 transitions. [2022-07-26 14:17:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 421. [2022-07-26 14:17:31,284 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:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1169 transitions. [2022-07-26 14:17:31,285 INFO L242 hiAutomatonCegarLoop]: Abstraction has 421 states and 1169 transitions. [2022-07-26 14:17:31,285 INFO L426 stractBuchiCegarLoop]: Abstraction has 421 states and 1169 transitions. [2022-07-26 14:17:31,285 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-26 14:17:31,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 421 states and 1169 transitions. [2022-07-26 14:17:31,287 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 48 [2022-07-26 14:17:31,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:17:31,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:17:31,288 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:17:31,288 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:17:31,288 INFO L733 eck$LassoCheckResult]: Stem: 7207#[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] 7137#[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] 7139#[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] 7141#[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] 7271#[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] 7269#[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] 7535#[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] 7537#[thread2ENTRY, L102-4, L59]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] 7663#[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_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .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] 7661#[L79, L49-2, 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] 7659#[L79, L54, L102-4]don't care [2022-07-26 14:17:31,288 INFO L735 eck$LassoCheckResult]: Loop: 7659#[L79, L54, 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)) (<= 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)) (= (ite (= 0 (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~new~0_27 v_~v_old~0_16)) 1 0)) 0 1) v_~ok~0_16) (= |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] 7681#[L54, L102-4, L76]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] 7659#[L79, L54, L102-4]don't care [2022-07-26 14:17:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 144539175, now seen corresponding path program 2 times [2022-07-26 14:17:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:31,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624216460] [2022-07-26 14:17:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:31,305 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:31,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 3 times [2022-07-26 14:17:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:31,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739523328] [2022-07-26 14:17:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:31,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:31,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1463214299, now seen corresponding path program 2 times [2022-07-26 14:17:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:17:31,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950449337] [2022-07-26 14:17:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:17:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:17:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:31,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:17:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:17:31,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:17:32,515 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:33,549 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:17:33,549 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:17:33,549 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:17:33,549 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:17:33,549 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:17:33,549 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:33,549 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:17:33,549 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:17:33,549 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration12_Lasso [2022-07-26 14:17:33,549 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:17:33,549 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:17:33,552 INFO L142 MapEliminator]: 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:33,553 INFO L142 MapEliminator]: 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:33,554 INFO L142 MapEliminator]: 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:33,555 INFO L142 MapEliminator]: 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:33,558 INFO L142 MapEliminator]: 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:33,560 INFO L142 MapEliminator]: 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:33,563 INFO L142 MapEliminator]: 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:33,564 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:33,565 INFO L142 MapEliminator]: 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:33,566 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:33,568 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:33,569 INFO L142 MapEliminator]: 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:33,570 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:33,573 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:33,574 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:33,575 INFO L142 MapEliminator]: 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:34,829 INFO L142 MapEliminator]: 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:34,831 INFO L142 MapEliminator]: 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:34,833 INFO L142 MapEliminator]: 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:34,834 INFO L142 MapEliminator]: 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:34,835 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,836 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,837 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,839 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,840 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,841 INFO L142 MapEliminator]: 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:34,842 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,844 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,845 INFO L142 MapEliminator]: 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:34,846 INFO L142 MapEliminator]: 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: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:34,849 INFO L142 MapEliminator]: 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:34,852 INFO L142 MapEliminator]: 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:34,853 INFO L142 MapEliminator]: 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:34,854 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,855 INFO L142 MapEliminator]: 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:34,857 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,858 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,859 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,866 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,869 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,870 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:17:34,871 INFO L142 MapEliminator]: 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,216 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:17:36,216 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:17:36,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,217 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:36,226 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:36,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:36,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-26 14:17:36,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,247 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:36,248 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:36,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,269 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:36,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,270 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:36,270 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:36,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,292 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:36,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,293 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:36,293 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:36,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-26 14:17:36,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,320 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:36,321 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:36,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,342 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:36,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,343 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:36,350 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:36,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:36,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,397 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:36,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,399 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:36,399 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:36,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-07-26 14:17:36,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,421 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:36,421 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:36,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:36,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,443 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:36,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,444 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:36,444 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:36,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:36,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,469 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:36,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,470 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:36,470 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:36,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:36,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,493 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:36,494 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:36,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,527 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:36,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,528 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:36,529 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:36,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-07-26 14:17:36,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,554 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:36,554 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:36,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2022-07-26 14:17:36,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,578 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:36,579 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:36,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:36,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,600 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:36,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,601 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:36,602 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:36,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:36,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:17:36,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:17:36,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:17:36,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,630 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:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,631 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:36,632 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:36,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-07-26 14:17:36,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,656 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:36,657 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:36,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,676 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 (152)] 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 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:36,706 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:36,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:36,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2022-07-26 14:17:36,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,729 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:36,730 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:36,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:36,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,754 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:36,754 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:36,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2022-07-26 14:17:36,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,779 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:36,780 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:36,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,803 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:36,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,804 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:36,805 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:36,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,828 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:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,829 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:36,830 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:36,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,854 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:36,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,855 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:36,856 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:36,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,862 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:17:36,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,866 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:17:36,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2022-07-26 14:17:36,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,889 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:36,890 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:36,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2022-07-26 14:17:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,915 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:36,915 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:36,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:36,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:36,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:36,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:36,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:36,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2022-07-26 14:17:36,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:36,947 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:36,947 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:36,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:36,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:36,954 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-26 14:17:36,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:36,987 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2022-07-26 14:17:36,987 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-07-26 14:17:37,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:37,051 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:37,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:37,053 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:37,053 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:37,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:37,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:37,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:37,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:37,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:37,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:37,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:37,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:37,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:37,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:37,104 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:37,105 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:37,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:37,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:37,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:37,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:37,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:37,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:37,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:37,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:37,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:37,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:37,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:37,152 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:37,153 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:37,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:37,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:37,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:37,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:37,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:37,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:37,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:37,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:37,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2022-07-26 14:17:37,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:37,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:37,196 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:37,196 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:37,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:37,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:37,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:37,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:37,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:37,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:37,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:37,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:37,242 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:37,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:37,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:37,243 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:37,244 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:37,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:17:37,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:37,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:37,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:17:37,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:37,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:17:37,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:17:37,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:17:37,283 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:37,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:37,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:37,284 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:37,285 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:37,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:37,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:17:37,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:17:37,292 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-26 14:17:37,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:17:37,344 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2022-07-26 14:17:37,345 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-07-26 14:17:37,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:17:37,942 INFO L443 ModelExtractionUtils]: Simplification made 54 calls to the SMT solver. [2022-07-26 14:17:37,942 INFO L444 ModelExtractionUtils]: 50 out of 134 variables were initially zero. Simplification set additionally 81 variables to zero. [2022-07-26 14:17:37,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:17:37,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:17:37,943 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:37,944 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:37,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:17:37,952 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2022-07-26 14:17:37,952 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:17:37,952 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:37,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2022-07-26 14:17:38,158 INFO L156 tatePredicateManager]: 63 out of 63 supporting invariants were superfluous and have been removed [2022-07-26 14:17:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:17:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:38,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:17:38,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:17:38,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:17:38,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:17:38,243 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:38,243 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:38,243 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:38,293 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:38,293 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:38,294 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:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-07-26 14:17:38,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-26 14:17:38,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:38,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 14 letters. Loop has 2 letters. [2022-07-26 14:17:38,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:38,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-26 14:17:38,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:17:38,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 881 states and 2528 transitions. [2022-07-26 14:17:38,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:17:38,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 881 states to 0 states and 0 transitions. [2022-07-26 14:17:38,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 14:17:38,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 14:17:38,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 14:17:38,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:17:38,302 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:17:38,302 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:17:38,302 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:17:38,302 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-26 14:17:38,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 14:17:38,302 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:17:38,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 14:17:38,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:17:38 BoogieIcfgContainer [2022-07-26 14:17:38,307 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:17:38,308 INFO L158 Benchmark]: Toolchain (without parser) took 36905.33ms. Allocated memory was 204.5MB in the beginning and 354.4MB in the end (delta: 149.9MB). Free memory was 153.7MB in the beginning and 136.5MB in the end (delta: 17.1MB). Peak memory consumption was 167.8MB. Max. memory is 8.0GB. [2022-07-26 14:17:38,308 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:17:38,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.73ms. Allocated memory is still 204.5MB. Free memory was 153.5MB in the beginning and 177.7MB in the end (delta: -24.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-07-26 14:17:38,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.33ms. Allocated memory is still 204.5MB. Free memory was 177.7MB in the beginning and 175.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:17:38,309 INFO L158 Benchmark]: Boogie Preprocessor took 27.73ms. Allocated memory is still 204.5MB. Free memory was 175.8MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 14:17:38,309 INFO L158 Benchmark]: RCFGBuilder took 552.40ms. Allocated memory is still 204.5MB. Free memory was 174.2MB in the beginning and 150.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-07-26 14:17:38,309 INFO L158 Benchmark]: BuchiAutomizer took 36065.64ms. Allocated memory was 204.5MB in the beginning and 354.4MB in the end (delta: 149.9MB). Free memory was 150.1MB in the beginning and 136.5MB in the end (delta: 13.5MB). Peak memory consumption was 165.0MB. Max. memory is 8.0GB. [2022-07-26 14:17:38,310 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 204.5MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.73ms. Allocated memory is still 204.5MB. Free memory was 153.5MB in the beginning and 177.7MB in the end (delta: -24.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.33ms. Allocated memory is still 204.5MB. Free memory was 177.7MB in the beginning and 175.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.73ms. Allocated memory is still 204.5MB. Free memory was 175.8MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 552.40ms. Allocated memory is still 204.5MB. Free memory was 174.2MB in the beginning and 150.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 36065.64ms. Allocated memory was 204.5MB in the beginning and 354.4MB in the end (delta: 149.9MB). Free memory was 150.1MB in the beginning and 136.5MB in the end (delta: 13.5MB). Peak memory consumption was 165.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 35.9s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 29.6s. Construction of modules took 0.4s. 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.6s 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: 85ms 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.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 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:38,331 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:38,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-07-26 14:17:38,737 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...