/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-noLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/sssc12.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:22:23,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:22:23,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:22:23,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:22:23,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:22:23,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:22:23,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:22:23,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:22:23,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:22:23,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:22:23,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:22:23,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:22:23,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:22:23,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:22:23,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:22:23,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:22:23,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:22:23,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:22:23,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:22:23,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:22:23,746 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:22:23,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:22:23,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:22:23,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:22:23,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:22:23,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:22:23,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:22:23,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:22:23,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:22:23,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:22:23,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:22:23,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:22:23,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:22:23,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:22:23,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:22:23,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:22:23,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:22:23,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:22:23,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:22:23,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:22:23,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:22:23,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:22:23,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-26 13:22:23,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:22:23,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:22:23,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:22:23,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:22:23,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:22:23,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:22:23,799 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:22:23,800 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:22:23,800 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:22:23,800 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:22:23,800 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:22:23,801 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:22:23,801 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:22:23,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:22:23,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:22:23,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:22:23,803 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:22:23,803 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:22:23,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:22:23,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:22:23,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:22:23,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:22:23,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:22:23,803 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-26 13:22:23,804 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:22:23,804 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 13:22:24,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:22:24,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:22:24,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:22:24,035 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:22:24,035 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:22:24,036 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12.i [2022-07-26 13:22:24,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d5249fa/d72b28b4117f4c27b46cc72b0403d6cb/FLAG4af9d32ba [2022-07-26 13:22:24,535 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:22:24,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i [2022-07-26 13:22:24,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d5249fa/d72b28b4117f4c27b46cc72b0403d6cb/FLAG4af9d32ba [2022-07-26 13:22:25,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d5249fa/d72b28b4117f4c27b46cc72b0403d6cb [2022-07-26 13:22:25,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:22:25,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:22:25,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:22:25,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:22:25,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:22:25,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2843c9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25, skipping insertion in model container [2022-07-26 13:22:25,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:22:25,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:22:25,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i[46865,46878] [2022-07-26 13:22:25,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:22:25,445 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:22:25,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i[46865,46878] [2022-07-26 13:22:25,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:22:25,515 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:22:25,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25 WrapperNode [2022-07-26 13:22:25,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:22:25,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:22:25,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:22:25,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:22:25,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,551 INFO L137 Inliner]: procedures = 275, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2022-07-26 13:22:25,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:22:25,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:22:25,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:22:25,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:22:25,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:22:25,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:22:25,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:22:25,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:22:25,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (1/1) ... [2022-07-26 13:22:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:22:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:22:25,656 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 13:22:25,674 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 13:22:25,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:22:25,686 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-07-26 13:22:25,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-07-26 13:22:25,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:22:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:22:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:22:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:22:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 13:22:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:22:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:22:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:22:25,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:22:25,688 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 13:22:25,807 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:22:25,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:22:26,007 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:22:26,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:22:26,031 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-26 13:22:26,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:22:26 BoogieIcfgContainer [2022-07-26 13:22:26,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:22:26,035 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:22:26,035 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:22:26,039 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:22:26,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:22:26,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:22:25" (1/3) ... [2022-07-26 13:22:26,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@591f78b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:22:26, skipping insertion in model container [2022-07-26 13:22:26,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:22:26,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:22:25" (2/3) ... [2022-07-26 13:22:26,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@591f78b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:22:26, skipping insertion in model container [2022-07-26 13:22:26,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:22:26,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:22:26" (3/3) ... [2022-07-26 13:22:26,042 INFO L322 chiAutomizerObserver]: Analyzing ICFG sssc12.i [2022-07-26 13:22:26,108 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-26 13:22:26,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 81 transitions, 167 flow [2022-07-26 13:22:26,159 INFO L129 PetriNetUnfolder]: 8/93 cut-off events. [2022-07-26 13:22:26,159 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-26 13:22:26,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 93 events. 8/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 46. Up to 4 conditions per place. [2022-07-26 13:22:26,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 81 transitions, 167 flow [2022-07-26 13:22:26,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 81 transitions, 167 flow [2022-07-26 13:22:26,176 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:22:26,176 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:22:26,176 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:22:26,177 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:22:26,177 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:22:26,177 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:22:26,177 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:22:26,177 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:22:26,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:22:26,259 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 183 [2022-07-26 13:22:26,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:22:26,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:22:26,264 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:26,264 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:22:26,264 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:22:26,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 477 states, but on-demand construction may add more states [2022-07-26 13:22:26,276 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 183 [2022-07-26 13:22:26,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:22:26,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:22:26,277 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:26,277 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:22:26,282 INFO L733 eck$LassoCheckResult]: Stem: 80#[ULTIMATE.startENTRY]don't care [220] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 83#[L-1]don't care [200] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 85#[L-1-1]don't care [224] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 87#[L-1-2]don't care [225] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 89#[L991]don't care [164] L991-->L991-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 91#[L991-1]don't care [226] L991-1-->L991-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 93#[L991-2]don't care [196] L991-2-->L991-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 95#[L991-3]don't care [194] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 97#[L991-4]don't care [198] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 99#[L1006]don't care [230] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 101#[L1007]don't care [166] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 103#[L1008]don't care [184] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 105#[L-1-3]don't care [227] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 107#[L-1-4]don't care [211] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 109#[L-1-5]don't care [178] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 111#[L-1-6]don't care [210] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 113#[L1039]don't care [159] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 115#[L1039-1]don't care [191] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 117#[L1041]don't care [204] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 119#[L1042]don't care [173] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 121#[L1042-1]don't care [228] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 123#[L1043]don't care [215] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 125#[L1043-1]don't care [162] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 127#[L1043-2]don't care [206] L1043-2-->L993: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 129#[L993]don't care [219] L993-->L994: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 131#[L994]don't care [214] L994-->L993-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 135#[L993-1]don't care [201] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 137#[L1044]don't care [155] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 139#[L1044-1]don't care [177] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 141#[L1044-2]don't care [209] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 143#[L1045-2]don't care [169] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 147#[L1046]don't care [231] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 151#[L1046-1]don't care [186] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 155#[L1046-2]don't care [193] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 159#[L1046-3]don't care [268] L1046-3-->thrENTRY: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thrThread1of1ForFork0_thidvar0_2) (= |v_thrThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_20|, thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_4|, thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_14|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_4|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_4|, thrThread1of1ForFork0_thidvar0=v_thrThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thrThread1of1ForFork0_#res#1.offset=|v_thrThread1of1ForFork0_#res#1.offset_4|, thrThread1of1ForFork0_thidvar1=v_thrThread1of1ForFork0_thidvar1_2, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_4|, thrThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of1ForFork0_#res#1.base=|v_thrThread1of1ForFork0_#res#1.base_4|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_10|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1, thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of1ForFork0_~end~0#1, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of1ForFork0_~arg#1.base, thrThread1of1ForFork0_#in~arg#1.base, thrThread1of1ForFork0_thidvar0, thrThread1of1ForFork0_#res#1.offset, thrThread1of1ForFork0_thidvar1, thrThread1of1ForFork0_#in~arg#1.offset, thrThread1of1ForFork0_assume_abort_if_not_~cond#1, thrThread1of1ForFork0_#res#1.base, thrThread1of1ForFork0___VERIFIER_assert_~cond#1] 163#[L1046-4, thrENTRY]don't care [195] L1046-4-->L1046-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 167#[L1046-5, thrENTRY]don't care [187] L1046-5-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 175#[L1045-2, thrENTRY]don't care [169] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 185#[L1046, thrENTRY]don't care [231] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 199#[L1046-1, thrENTRY]don't care [186] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 217#[L1046-2, thrENTRY]don't care [193] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 239#[L1046-3, thrENTRY]don't care [266] L1046-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 265#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [2022-07-26 13:22:26,283 INFO L735 eck$LassoCheckResult]: Loop: 265#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [267] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 265#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [2022-07-26 13:22:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1529995297, now seen corresponding path program 1 times [2022-07-26 13:22:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:26,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191800826] [2022-07-26 13:22:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:26,445 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:22:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:26,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:22:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 298, now seen corresponding path program 1 times [2022-07-26 13:22:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:26,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279660754] [2022-07-26 13:22:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:26,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:22:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:26,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:22:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash -185213684, now seen corresponding path program 1 times [2022-07-26 13:22:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:26,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661558492] [2022-07-26 13:22:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:26,581 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:22:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:26,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:22:27,302 WARN L146 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-26 13:22:27,335 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-26 13:22:27,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 114 transitions, 240 flow [2022-07-26 13:22:27,377 INFO L129 PetriNetUnfolder]: 13/140 cut-off events. [2022-07-26 13:22:27,377 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:22:27,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 140 events. 13/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 249 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2022-07-26 13:22:27,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 114 transitions, 240 flow [2022-07-26 13:22:27,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 114 transitions, 240 flow [2022-07-26 13:22:27,385 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:22:27,385 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:22:27,385 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:22:27,385 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:22:27,386 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:22:27,386 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:22:27,386 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:22:27,386 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:22:27,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:22:28,041 INFO L131 ngComponentsAnalysis]: Automaton has 893 accepting balls. 8233 [2022-07-26 13:22:28,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:22:28,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:22:28,043 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:28,043 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:28,043 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:22:28,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 13063 states, but on-demand construction may add more states [2022-07-26 13:22:28,218 INFO L131 ngComponentsAnalysis]: Automaton has 893 accepting balls. 8233 [2022-07-26 13:22:28,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:22:28,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:22:28,222 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:28,223 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:28,224 INFO L733 eck$LassoCheckResult]: Stem: 111#[ULTIMATE.startENTRY]don't care [334] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 114#[L-1]don't care [314] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 116#[L-1-1]don't care [338] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 118#[L-1-2]don't care [339] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 120#[L991]don't care [278] L991-->L991-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 122#[L991-1]don't care [340] L991-1-->L991-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 124#[L991-2]don't care [310] L991-2-->L991-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 126#[L991-3]don't care [308] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 128#[L991-4]don't care [312] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 130#[L1006]don't care [344] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 132#[L1007]don't care [280] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 134#[L1008]don't care [298] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 136#[L-1-3]don't care [341] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 138#[L-1-4]don't care [325] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 140#[L-1-5]don't care [292] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 142#[L-1-6]don't care [324] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 144#[L1039]don't care [273] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 146#[L1039-1]don't care [305] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 148#[L1041]don't care [318] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 150#[L1042]don't care [287] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 152#[L1042-1]don't care [342] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 154#[L1043]don't care [329] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 156#[L1043-1]don't care [276] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 158#[L1043-2]don't care [320] L1043-2-->L993: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 160#[L993]don't care [333] L993-->L994: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 162#[L994]don't care [328] L994-->L993-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 166#[L993-1]don't care [315] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 168#[L1044]don't care [269] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 170#[L1044-1]don't care [291] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 172#[L1044-2]don't care [323] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 174#[L1045-2]don't care [283] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 178#[L1046]don't care [345] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 182#[L1046-1]don't care [300] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 186#[L1046-2]don't care [307] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 190#[L1046-3]don't care [414] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= v_thrThread1of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_12|) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_20|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_assume_abort_if_not_~cond#1, thrThread1of2ForFork0_#in~arg#1.offset] 194#[L1046-4, thrENTRY]don't care [380] thrENTRY-->L1022: Formula: (and (= |v_thrThread1of2ForFork0_~arg#1.base_1| |v_thrThread1of2ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of2ForFork0_~arg#1.offset_1| |v_thrThread1of2ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} OutVars{thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_1|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_1|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_~arg#1.base] 200#[L1022, L1046-4]don't care [381] L1022-->L1022-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1] 208#[L1046-4, L1022-1]don't care [382] L1022-1-->L1023: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1] 218#[L1023, L1046-4]don't care [383] L1023-->L1024: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1] 232#[L1024, L1046-4]don't care [384] L1024-->L1025: Formula: (= |v_thrThread1of2ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1] 250#[L1046-4, L1025]don't care [385] L1025-->L1010: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 272#[L1010, L1046-4]don't care [386] L1010-->L1013: Formula: (and (= |v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_1|) (= v_~lock~0_23 1) (= |v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (= v_~lock~0_24 0) 1 0)) (not (= |v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_1| 0))) InVars {~lock~0=v_~lock~0_24} OutVars{~lock~0=v_~lock~0_23, thrThread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_1|, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~lock~0, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of2ForFork0_assume_abort_if_not_~cond#1] 298#[L1046-4, L1013]don't care [387] L1013-->L1026: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 330#[L1046-4, L1026]don't care [389] L1026-->L1026-2: Formula: (not (<= (+ v_~next~0_7 10) v_~len~0_6)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[] 372#[L1046-4, L1026-2]don't care [391] L1026-2-->L1016: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 426#[L1016, L1046-4]don't care [393] L1016-->L1019: Formula: (and (= |v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_3|) (= v_~lock~0_29 0) (not (= |v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= v_~lock~0_30 1) 1 0))) InVars {~lock~0=v_~lock~0_30} OutVars{~lock~0=v_~lock~0_29, thrThread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_3|, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[~lock~0, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of2ForFork0_assume_abort_if_not_~cond#1] 496#[L1019, L1046-4]don't care [395] L1019-->L1031-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 586#[L1046-4, L1031-2]don't care [2022-07-26 13:22:28,225 INFO L735 eck$LassoCheckResult]: Loop: 586#[L1046-4, L1031-2]don't care [398] L1031-2-->L1032: Formula: (< |v_thrThread1of2ForFork0_~c~0#1_9| |v_thrThread1of2ForFork0_~end~0#1_11|) InVars {thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[] 702#[L1032, L1046-4]don't care [400] L1032-->L1032-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 848#[L1032-1, L1046-4]don't care [402] L1032-1-->L1032-2: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (and (<= 0 |v_thrThread1of2ForFork0_~c~0#1_11|) (< |v_thrThread1of2ForFork0_~c~0#1_11| v_~len~0_7)) 1 0)) InVars {~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1] 1024#[L1032-2, L1046-4]don't care [403] L1032-2-->L996: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1] 1234#[L1046-4, L996]don't care [404] L996-->L997: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1] 1482#[L997, L1046-4]don't care [406] L997-->L997-2: Formula: (not (= |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] 1774#[L1046-4, L997-2]don't care [408] L997-2-->L1033: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2112#[L1046-4, L1033]don't care [410] L1033-->L1033-1: Formula: (let ((.cse0 (* |v_thrThread1of2ForFork0_~c~0#1_13| 4))) (let ((.cse1 (+ v_~data~0.offset_3 .cse0))) (and (<= (+ v_~data~0.offset_3 .cse0 4) (select |v_#length_8| v_~data~0.base_3)) (= (store |v_#memory_int_6| v_~data~0.base_3 (store (select |v_#memory_int_6| v_~data~0.base_3) .cse1 0)) |v_#memory_int_5|) (= (select |v_#valid_11| v_~data~0.base_3) 1) (<= 0 .cse1)))) InVars {~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_8|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} OutVars{~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_8|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} AuxVars[] AssignedVars[#memory_int] 2500#[L1046-4, L1033-1]don't care [411] L1033-1-->L1031-2: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_16| (+ |v_thrThread1of2ForFork0_~c~0#1_15| 1)) InVars {thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_15|} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1] 586#[L1046-4, L1031-2]don't care [2022-07-26 13:22:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash 322098984, now seen corresponding path program 1 times [2022-07-26 13:22:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:28,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072710782] [2022-07-26 13:22:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:28,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:22:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:28,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:22:28,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1631976301, now seen corresponding path program 1 times [2022-07-26 13:22:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:28,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577152224] [2022-07-26 13:22:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:28,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:28,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:22:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:28,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:22:28,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash -386315956, now seen corresponding path program 1 times [2022-07-26 13:22:28,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:28,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960134685] [2022-07-26 13:22:28,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:28,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:22:28,417 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 13:22:28,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:22:28,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960134685] [2022-07-26 13:22:28,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960134685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:22:28,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:22:28,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 13:22:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866935792] [2022-07-26 13:22:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:22:28,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:22:28,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:22:28,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:22:28,545 INFO L87 Difference]: Start difference. First operand currently 13063 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 13:22:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:22:28,695 INFO L93 Difference]: Finished difference Result 8121 states and 24326 transitions. [2022-07-26 13:22:28,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8121 states and 24326 transitions. [2022-07-26 13:22:28,782 INFO L131 ngComponentsAnalysis]: Automaton has 869 accepting balls. 4445 [2022-07-26 13:22:28,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8121 states to 8120 states and 24325 transitions. [2022-07-26 13:22:28,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8120 [2022-07-26 13:22:28,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8120 [2022-07-26 13:22:28,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8120 states and 24325 transitions. [2022-07-26 13:22:28,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:22:28,934 INFO L220 hiAutomatonCegarLoop]: Abstraction has 8120 states and 24325 transitions. [2022-07-26 13:22:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8120 states and 24325 transitions. [2022-07-26 13:22:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8120 to 7427. [2022-07-26 13:22:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7427 states have (on average 3.0259862663255688) internal successors, (22474), 7426 states have internal predecessors, (22474), 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 13:22:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 22474 transitions. [2022-07-26 13:22:29,221 INFO L242 hiAutomatonCegarLoop]: Abstraction has 7427 states and 22474 transitions. [2022-07-26 13:22:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 13:22:29,224 INFO L426 stractBuchiCegarLoop]: Abstraction has 7427 states and 22474 transitions. [2022-07-26 13:22:29,225 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:22:29,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7427 states and 22474 transitions. [2022-07-26 13:22:29,315 INFO L131 ngComponentsAnalysis]: Automaton has 788 accepting balls. 4172 [2022-07-26 13:22:29,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:22:29,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:22:29,317 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:29,317 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:22:29,318 INFO L733 eck$LassoCheckResult]: Stem: 48078#[ULTIMATE.startENTRY]don't care [334] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 46674#[L-1]don't care [314] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 37264#[L-1-1]don't care [338] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 37266#[L-1-2]don't care [339] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 45456#[L991]don't care [278] L991-->L991-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 35444#[L991-1]don't care [340] L991-1-->L991-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 35446#[L991-2]don't care [310] L991-2-->L991-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 41976#[L991-3]don't care [308] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 41324#[L991-4]don't care [312] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 41326#[L1006]don't care [344] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 46344#[L1007]don't care [280] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 38976#[L1008]don't care [298] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 38568#[L-1-3]don't care [341] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 38570#[L-1-4]don't care [325] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43246#[L-1-5]don't care [292] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 43750#[L-1-6]don't care [324] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 43752#[L1039]don't care [273] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 46872#[L1039-1]don't care [305] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 44388#[L1041]don't care [318] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 44390#[L1042]don't care [287] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 41604#[L1042-1]don't care [342] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 41606#[L1043]don't care [329] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44088#[L1043-1]don't care [276] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 39028#[L1043-2]don't care [320] L1043-2-->L993: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 39030#[L993]don't care [333] L993-->L994: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 45444#[L994]don't care [328] L994-->L993-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 45446#[L993-1]don't care [315] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 38222#[L1044]don't care [269] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 38224#[L1044-1]don't care [291] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 42468#[L1044-2]don't care [323] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 42898#[L1045-2]don't care [283] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 46812#[L1046]don't care [345] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 42324#[L1046-1]don't care [300] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 42326#[L1046-2]don't care [307] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 44690#[L1046-3]don't care [414] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= v_thrThread1of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_12|) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_20|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_assume_abort_if_not_~cond#1, thrThread1of2ForFork0_#in~arg#1.offset] 44692#[L1046-4, thrENTRY]don't care [309] L1046-4-->L1046-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 34508#[L1046-5, thrENTRY]don't care [301] L1046-5-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 34512#[L1045-2, thrENTRY]don't care [283] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44300#[thrENTRY, L1046]don't care [345] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 35136#[L1046-1, thrENTRY]don't care [300] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 35138#[L1046-2, thrENTRY]don't care [307] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 43124#[L1046-3, thrENTRY]don't care [415] L1046-3-->thrENTRY: Formula: (and (= v_thrThread2of2ForFork0_thidvar1_2 0) (= |v_thrThread2of2ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread2of2ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread2of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_14|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_14|} OutVars{thrThread2of2ForFork0_thidvar1=v_thrThread2of2ForFork0_thidvar1_2, thrThread2of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of2ForFork0___VERIFIER_assert_~cond#1_10|, thrThread2of2ForFork0_#in~arg#1.offset=|v_thrThread2of2ForFork0_#in~arg#1.offset_4|, thrThread2of2ForFork0_~end~0#1=|v_thrThread2of2ForFork0_~end~0#1_14|, thrThread2of2ForFork0_#res#1.base=|v_thrThread2of2ForFork0_#res#1.base_4|, thrThread2of2ForFork0_~arg#1.base=|v_thrThread2of2ForFork0_~arg#1.base_4|, thrThread2of2ForFork0_~arg#1.offset=|v_thrThread2of2ForFork0_~arg#1.offset_4|, thrThread2of2ForFork0_#res#1.offset=|v_thrThread2of2ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_14|, thrThread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of2ForFork0_assume_abort_if_not_~cond#1_6|, thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread2of2ForFork0_thidvar0=v_thrThread2of2ForFork0_thidvar0_2, thrThread2of2ForFork0_~c~0#1=|v_thrThread2of2ForFork0_~c~0#1_20|, thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread2of2ForFork0_#in~arg#1.base=|v_thrThread2of2ForFork0_#in~arg#1.base_4|} AuxVars[] AssignedVars[thrThread2of2ForFork0_thidvar1, thrThread2of2ForFork0___VERIFIER_assert_~cond#1, thrThread2of2ForFork0_#in~arg#1.offset, thrThread2of2ForFork0_~end~0#1, thrThread2of2ForFork0_#res#1.base, thrThread2of2ForFork0_~arg#1.base, thrThread2of2ForFork0_~arg#1.offset, thrThread2of2ForFork0_#res#1.offset, thrThread2of2ForFork0_assume_abort_if_not_~cond#1, thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of2ForFork0_thidvar0, thrThread2of2ForFork0_~c~0#1, thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of2ForFork0_#in~arg#1.base] 42838#[thrENTRY, L1046-4, thrENTRY]don't care [309] L1046-4-->L1046-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 42840#[thrENTRY, thrENTRY, L1046-5]don't care [301] L1046-5-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 36624#[L1045-2, thrENTRY, thrENTRY]don't care [283] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 36626#[L1046, thrENTRY, thrENTRY]don't care [345] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 40444#[L1046-1, thrENTRY, thrENTRY]don't care [300] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 44496#[thrENTRY, L1046-2, thrENTRY]don't care [307] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 47764#[thrENTRY, L1046-3, thrENTRY]don't care [412] L1046-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 47880#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY, thrENTRY]don't care [2022-07-26 13:22:29,318 INFO L735 eck$LassoCheckResult]: Loop: 47880#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY, thrENTRY]don't care [413] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 47880#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY, thrENTRY]don't care [2022-07-26 13:22:29,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2047548515, now seen corresponding path program 1 times [2022-07-26 13:22:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:29,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536898918] [2022-07-26 13:22:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:29,349 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:22:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:29,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:22:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash 444, now seen corresponding path program 1 times [2022-07-26 13:22:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:29,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951782756] [2022-07-26 13:22:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:29,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:29,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:22:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:29,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:22:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:22:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash 950505888, now seen corresponding path program 1 times [2022-07-26 13:22:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:22:29,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710357957] [2022-07-26 13:22:29,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:22:29,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:22:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:29,405 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:22:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:22:29,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:22:30,132 WARN L146 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-26 13:22:30,147 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-26 13:22:30,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 147 transitions, 315 flow [2022-07-26 13:22:30,182 INFO L129 PetriNetUnfolder]: 18/187 cut-off events. [2022-07-26 13:22:30,183 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-26 13:22:30,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 187 events. 18/187 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2022-07-26 13:22:30,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 147 transitions, 315 flow [2022-07-26 13:22:30,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 147 transitions, 315 flow [2022-07-26 13:22:30,190 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:22:30,190 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:22:30,190 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:22:30,190 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:22:30,190 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:22:30,190 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:22:30,190 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:22:30,190 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:22:30,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:22:52,878 INFO L131 ngComponentsAnalysis]: Automaton has 21769 accepting balls. 291579 [2022-07-26 13:22:52,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:22:52,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:22:52,888 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:52,889 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:22:52,889 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:22:52,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 378057 states, but on-demand construction may add more states [2022-07-26 13:23:01,596 INFO L131 ngComponentsAnalysis]: Automaton has 21769 accepting balls. 291579 [2022-07-26 13:23:01,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:23:01,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:23:01,605 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:23:01,605 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:23:01,609 INFO L733 eck$LassoCheckResult]: Stem: 142#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 145#[L-1]don't care [461] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 147#[L-1-1]don't care [485] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 149#[L-1-2]don't care [486] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 151#[L991]don't care [425] L991-->L991-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 153#[L991-1]don't care [487] L991-1-->L991-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 155#[L991-2]don't care [457] L991-2-->L991-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 157#[L991-3]don't care [455] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 159#[L991-4]don't care [459] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 161#[L1006]don't care [491] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 163#[L1007]don't care [427] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 165#[L1008]don't care [445] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 167#[L-1-3]don't care [488] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 169#[L-1-4]don't care [472] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 171#[L-1-5]don't care [439] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 173#[L-1-6]don't care [471] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 175#[L1039]don't care [420] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 177#[L1039-1]don't care [452] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 179#[L1041]don't care [465] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 181#[L1042]don't care [434] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 183#[L1042-1]don't care [489] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 185#[L1043]don't care [476] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 187#[L1043-1]don't care [423] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 189#[L1043-2]don't care [467] L1043-2-->L993: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 191#[L993]don't care [480] L993-->L994: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 193#[L994]don't care [475] L994-->L993-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 197#[L993-1]don't care [462] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 199#[L1044]don't care [416] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 201#[L1044-1]don't care [438] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 203#[L1044-2]don't care [470] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 205#[L1045-2]don't care [430] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 209#[L1046]don't care [492] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 213#[L1046-1]don't care [447] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 217#[L1046-2]don't care [454] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 221#[L1046-3]don't care [593] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of3ForFork0_thidvar1_2 0) (= v_thrThread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_22|) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1] 225#[L1046-4, thrENTRY]don't care [495] thrENTRY-->L1022: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset] 231#[L1046-4, L1022]don't care [496] L1022-->L1022-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 239#[L1046-4, L1022-1]don't care [497] L1022-1-->L1023: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 249#[L1046-4, L1023]don't care [498] L1023-->L1024: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 263#[L1046-4, L1024]don't care [499] L1024-->L1025: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 281#[L1046-4, L1025]don't care [500] L1025-->L1010: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 303#[L1046-4, L1010]don't care [501] L1010-->L1013: Formula: (and (not (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1| |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~lock~0_23 1) (= |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (= v_~lock~0_24 0) 1 0))) InVars {~lock~0=v_~lock~0_24} OutVars{~lock~0=v_~lock~0_23, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~lock~0, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1] 329#[L1046-4, L1013]don't care [502] L1013-->L1026: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 361#[L1046-4, L1026]don't care [504] L1026-->L1026-2: Formula: (not (<= (+ v_~next~0_7 10) v_~len~0_6)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[] 403#[L1046-4, L1026-2]don't care [506] L1026-2-->L1016: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 457#[L1046-4, L1016]don't care [508] L1016-->L1019: Formula: (and (= |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= v_~lock~0_30 1) 1 0)) (= v_~lock~0_29 0) (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3| |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~lock~0=v_~lock~0_30} OutVars{~lock~0=v_~lock~0_29, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[~lock~0, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1] 527#[L1046-4, L1019]don't care [510] L1019-->L1031-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 617#[L1046-4, L1031-2]don't care [2022-07-26 13:23:01,610 INFO L735 eck$LassoCheckResult]: Loop: 617#[L1046-4, L1031-2]don't care [513] L1031-2-->L1032: Formula: (< |v_thrThread1of3ForFork0_~c~0#1_9| |v_thrThread1of3ForFork0_~end~0#1_11|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[] 733#[L1046-4, L1032]don't care [515] L1032-->L1032-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 879#[L1046-4, L1032-1]don't care [517] L1032-1-->L1032-2: Formula: (= (ite (and (< |v_thrThread1of3ForFork0_~c~0#1_11| v_~len~0_7) (<= 0 |v_thrThread1of3ForFork0_~c~0#1_11|)) 1 0) |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1] 1059#[L1046-4, L1032-2]don't care [518] L1032-2-->L996: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1] 1283#[L1046-4, L996]don't care [519] L996-->L997: Formula: (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1] 1565#[L1046-4, L997]don't care [521] L997-->L997-2: Formula: (not (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] 1925#[L1046-4, L997-2]don't care [523] L997-2-->L1033: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2383#[L1046-4, L1033]don't care [525] L1033-->L1033-1: Formula: (let ((.cse1 (* |v_thrThread1of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (store |v_#memory_int_6| v_~data~0.base_3 (store (select |v_#memory_int_6| v_~data~0.base_3) .cse0 0)) |v_#memory_int_5|) (<= 0 .cse0) (= (select |v_#valid_11| v_~data~0.base_3) 1) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_8| v_~data~0.base_3))))) InVars {~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} OutVars{~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 2965#[L1046-4, L1033-1]don't care [526] L1033-1-->L1031-2: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_16| (+ |v_thrThread1of3ForFork0_~c~0#1_15| 1)) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 617#[L1046-4, L1031-2]don't care [2022-07-26 13:23:01,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:23:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1007908155, now seen corresponding path program 1 times [2022-07-26 13:23:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:23:01,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275765205] [2022-07-26 13:23:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:23:01,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:23:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:01,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:23:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:01,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:23:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:23:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1909689222, now seen corresponding path program 1 times [2022-07-26 13:23:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:23:01,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759341164] [2022-07-26 13:23:01,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:23:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:23:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:01,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:23:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:01,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:23:01,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:23:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash 74930060, now seen corresponding path program 1 times [2022-07-26 13:23:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:23:01,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963619548] [2022-07-26 13:23:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:23:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:23:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:23:01,691 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 13:23:01,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:23:01,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963619548] [2022-07-26 13:23:01,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963619548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:23:01,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:23:01,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 13:23:01,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720282697] [2022-07-26 13:23:01,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:23:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:23:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:23:01,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:23:01,760 INFO L87 Difference]: Start difference. First operand currently 378057 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 13:23:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:23:04,768 INFO L93 Difference]: Finished difference Result 226661 states and 915111 transitions. [2022-07-26 13:23:04,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226661 states and 915111 transitions. [2022-07-26 13:23:10,803 INFO L131 ngComponentsAnalysis]: Automaton has 21027 accepting balls. 157283 [2022-07-26 13:23:16,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226661 states to 226660 states and 915110 transitions. [2022-07-26 13:23:16,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226660 [2022-07-26 13:23:17,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226660 [2022-07-26 13:23:17,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226660 states and 915110 transitions. [2022-07-26 13:23:18,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:23:18,499 INFO L220 hiAutomatonCegarLoop]: Abstraction has 226660 states and 915110 transitions. [2022-07-26 13:23:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226660 states and 915110 transitions. [2022-07-26 13:23:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226660 to 207235. [2022-07-26 13:23:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207235 states, 207235 states have (on average 4.068569498395541) internal successors, (843150), 207234 states have internal predecessors, (843150), 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 13:23:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207235 states to 207235 states and 843150 transitions. [2022-07-26 13:23:30,984 INFO L242 hiAutomatonCegarLoop]: Abstraction has 207235 states and 843150 transitions. [2022-07-26 13:23:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 13:23:30,986 INFO L426 stractBuchiCegarLoop]: Abstraction has 207235 states and 843150 transitions. [2022-07-26 13:23:30,986 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:23:30,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207235 states and 843150 transitions. [2022-07-26 13:23:34,370 INFO L131 ngComponentsAnalysis]: Automaton has 18987 accepting balls. 145859 [2022-07-26 13:23:34,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:23:34,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:23:34,382 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:23:34,383 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:23:34,387 INFO L733 eck$LassoCheckResult]: Stem: 1332113#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1332115#[L-1]don't care [461] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 990177#[L-1-1]don't care [485] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 990179#[L-1-2]don't care [486] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 1345909#[L991]don't care [425] L991-->L991-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 985599#[L991-1]don't care [487] L991-1-->L991-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 985601#[L991-2]don't care [457] L991-2-->L991-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 1348083#[L991-3]don't care [455] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 1347911#[L991-4]don't care [459] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 1347913#[L1006]don't care [491] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 1346263#[L1007]don't care [427] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 1346265#[L1008]don't care [445] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 1320511#[L-1-3]don't care [488] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1320513#[L-1-4]don't care [472] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1280313#[L-1-5]don't care [439] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1013147#[L-1-6]don't care [471] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 1013149#[L1039]don't care [420] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 1308431#[L1039-1]don't care [452] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 1348971#[L1041]don't care [465] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 1312527#[L1042]don't care [434] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 1312529#[L1042-1]don't care [489] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 1324197#[L1043]don't care [476] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1324199#[L1043-1]don't care [423] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1368505#[L1043-2]don't care [467] L1043-2-->L993: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1368507#[L993]don't care [480] L993-->L994: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1237527#[L994]don't care [475] L994-->L993-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 1237529#[L993-1]don't care [462] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1354017#[L1044]don't care [416] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 1337747#[L1044-1]don't care [438] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 1301937#[L1044-2]don't care [470] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 1259179#[L1045-2]don't care [430] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1259181#[L1046]don't care [492] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 1354781#[L1046-1]don't care [447] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1354783#[L1046-2]don't care [454] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 1349081#[L1046-3]don't care [593] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of3ForFork0_thidvar1_2 0) (= v_thrThread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_22|) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1] 1326621#[L1046-4, thrENTRY]don't care [495] thrENTRY-->L1022: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset] 1199903#[L1046-4, L1022]don't care [496] L1022-->L1022-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 1199905#[L1046-4, L1022-1]don't care [497] L1022-1-->L1023: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 1357639#[L1046-4, L1023]don't care [498] L1023-->L1024: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 1310211#[L1046-4, L1024]don't care [499] L1024-->L1025: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 990961#[L1046-4, L1025]don't care [500] L1025-->L1010: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 990963#[L1046-4, L1010]don't care [501] L1010-->L1013: Formula: (and (not (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1| |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~lock~0_23 1) (= |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (= v_~lock~0_24 0) 1 0))) InVars {~lock~0=v_~lock~0_24} OutVars{~lock~0=v_~lock~0_23, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~lock~0, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1] 1289033#[L1046-4, L1013]don't care [502] L1013-->L1026: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1291745#[L1046-4, L1026]don't care [503] L1026-->L1027: Formula: (<= (+ v_~next~0_3 10) v_~len~0_5) InVars {~next~0=v_~next~0_3, ~len~0=v_~len~0_5} OutVars{~next~0=v_~next~0_3, ~len~0=v_~len~0_5} AuxVars[] AssignedVars[] 1246765#[L1046-4, L1027]don't care [505] L1027-->L1028: Formula: (= v_~next~0_4 |v_thrThread1of3ForFork0_~c~0#1_5|) InVars {~next~0=v_~next~0_4} OutVars{~next~0=v_~next~0_4, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_5|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 1246769#[L1046-4, L1028]don't care [507] L1028-->L1028-1: Formula: (= (+ v_~next~0_5 10) |v_thrThread1of3ForFork0_~end~0#1_5|) InVars {~next~0=v_~next~0_5} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_5|, ~next~0=v_~next~0_5} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 1268395#[L1046-4, L1028-1]don't care [509] L1028-1-->L1026-2: Formula: (= v_~next~0_6 |v_thrThread1of3ForFork0_~end~0#1_7|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_7|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_7|, ~next~0=v_~next~0_6} AuxVars[] AssignedVars[~next~0] 1363139#[L1046-4, L1026-2]don't care [506] L1026-2-->L1016: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1372061#[L1046-4, L1016]don't care [508] L1016-->L1019: Formula: (and (= |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= v_~lock~0_30 1) 1 0)) (= v_~lock~0_29 0) (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3| |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~lock~0=v_~lock~0_30} OutVars{~lock~0=v_~lock~0_29, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[~lock~0, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1] 1374171#[L1046-4, L1019]don't care [510] L1019-->L1031-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1294677#[L1046-4, L1031-2]don't care [2022-07-26 13:23:34,395 INFO L735 eck$LassoCheckResult]: Loop: 1294677#[L1046-4, L1031-2]don't care [513] L1031-2-->L1032: Formula: (< |v_thrThread1of3ForFork0_~c~0#1_9| |v_thrThread1of3ForFork0_~end~0#1_11|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[] 1217049#[L1046-4, L1032]don't care [515] L1032-->L1032-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1217051#[L1046-4, L1032-1]don't care [517] L1032-1-->L1032-2: Formula: (= (ite (and (< |v_thrThread1of3ForFork0_~c~0#1_11| v_~len~0_7) (<= 0 |v_thrThread1of3ForFork0_~c~0#1_11|)) 1 0) |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1] 1357105#[L1046-4, L1032-2]don't care [518] L1032-2-->L996: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1] 1060181#[L1046-4, L996]don't care [519] L996-->L997: Formula: (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1] 1033681#[L1046-4, L997]don't care [521] L997-->L997-2: Formula: (not (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] 1033687#[L1046-4, L997-2]don't care [523] L997-2-->L1033: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1087861#[L1046-4, L1033]don't care [525] L1033-->L1033-1: Formula: (let ((.cse1 (* |v_thrThread1of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (store |v_#memory_int_6| v_~data~0.base_3 (store (select |v_#memory_int_6| v_~data~0.base_3) .cse0 0)) |v_#memory_int_5|) (<= 0 .cse0) (= (select |v_#valid_11| v_~data~0.base_3) 1) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_8| v_~data~0.base_3))))) InVars {~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} OutVars{~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 1087865#[L1046-4, L1033-1]don't care [526] L1033-1-->L1031-2: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_16| (+ |v_thrThread1of3ForFork0_~c~0#1_15| 1)) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 1294677#[L1046-4, L1031-2]don't care [2022-07-26 13:23:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:23:34,396 INFO L85 PathProgramCache]: Analyzing trace with hash -441104351, now seen corresponding path program 1 times [2022-07-26 13:23:34,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:23:34,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218962314] [2022-07-26 13:23:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:23:34,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:23:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:34,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:23:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:34,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:23:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:23:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1909689222, now seen corresponding path program 2 times [2022-07-26 13:23:34,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:23:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693964272] [2022-07-26 13:23:34,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:23:34,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:23:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:34,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:23:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:34,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:23:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:23:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1488807782, now seen corresponding path program 1 times [2022-07-26 13:23:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:23:34,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664316912] [2022-07-26 13:23:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:23:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:23:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:34,518 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:23:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:23:34,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:23:35,772 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:23:35,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:23:35,773 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:23:35,773 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:23:35,773 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:23:35,773 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:35,773 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:23:35,773 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:23:35,773 INFO L133 ssoRankerPreferences]: Filename of dumped script: sssc12.i_BEv2_Iteration2_Lasso [2022-07-26 13:23:35,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:23:35,774 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:23:35,816 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,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 13:23:35,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 13:23:35,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 13:23:35,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 13:23:35,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 13:23:35,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 13:23:35,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 13:23:35,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 13:23:35,848 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,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 13:23:35,851 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,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 13:23:35,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 13:23:35,856 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,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 13:23:35,860 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,862 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,864 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,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 13:23:35,867 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,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 13:23:35,873 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,875 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,877 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,878 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,880 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,881 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,883 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,884 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,886 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,887 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,889 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,890 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,892 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,893 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,895 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,897 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,899 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,900 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,902 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,903 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,905 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,907 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,908 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,910 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,914 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,916 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:35,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 13:23:35,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 13:23:35,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 13:23:35,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 13:23:36,226 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:23:36,784 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:23:36,787 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:23:36,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:36,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:36,807 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 13:23:36,821 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 13:23:36,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:36,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:36,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:23:36,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:36,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:36,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:36,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:23:36,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:23:36,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:36,869 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 13:23:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:36,871 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 13:23:36,892 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 13:23:36,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:36,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:36,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:36,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:36,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:36,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:36,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:36,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:36,963 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 13:23:36,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:36,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:36,964 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 13:23:36,983 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 13:23:36,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:36,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:36,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:36,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:36,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,067 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 13:23:37,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,080 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 13:23:37,095 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 13:23:37,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,152 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 13:23:37,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,169 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 13:23:37,240 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 13:23:37,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 13:23:37,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,290 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 13:23:37,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,291 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 13:23:37,293 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 13:23:37,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:23:37,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:23:37,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:23:37,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,348 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 13:23:37,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,349 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 13:23:37,350 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 13:23:37,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:23:37,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:23:37,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:23:37,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,389 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 13:23:37,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,390 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 13:23:37,391 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 13:23:37,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-26 13:23:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,471 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 13:23:37,472 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 13:23:37,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 13:23:37,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,512 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 13:23:37,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,515 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 13:23:37,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,530 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 13:23:37,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,555 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 13:23:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,558 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 13:23:37,559 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 13:23:37,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,600 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 13:23:37,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,619 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 13:23:37,620 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 13:23:37,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,664 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 13:23:37,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,684 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 13:23:37,686 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 13:23:37,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,754 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 13:23:37,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,767 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 13:23:37,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:23:37,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:23:37,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:23:37,813 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 13:23:37,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,836 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 13:23:37,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,837 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 13:23:37,852 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 13:23:37,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,898 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 13:23:37,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,899 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 13:23:37,920 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 13:23:37,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:37,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:37,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:37,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:37,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:37,986 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 13:23:37,988 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 13:23:37,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:37,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:37,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:37,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:37,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:37,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:37,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,044 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 13:23:38,070 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 13:23:38,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-26 13:23:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,112 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 13:23:38,120 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 13:23:38,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,159 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 13:23:38,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,160 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 13:23:38,163 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 13:23:38,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-26 13:23:38,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,255 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 13:23:38,270 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 13:23:38,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,310 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 13:23:38,311 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 13:23:38,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,364 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 13:23:38,367 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 13:23:38,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,420 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 13:23:38,444 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 13:23:38,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,522 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 13:23:38,551 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 13:23:38,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 13:23:38,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,608 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 13:23:38,631 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 13:23:38,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 13:23:38,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,697 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 13:23:38,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,722 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 13:23:38,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:23:38,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:23:38,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:23:38,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,762 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 13:23:38,781 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 13:23:38,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 13:23:38,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,825 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 13:23:38,844 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 13:23:38,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:23:38,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:23:38,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:23:38,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:38,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:38,920 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 13:23:38,943 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 13:23:38,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:38,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:38,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:38,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:38,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:38,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:38,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:38,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,014 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 13:23:39,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,021 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 13:23:39,047 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 13:23:39,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:23:39,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:23:39,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:23:39,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,108 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 13:23:39,109 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 13:23:39,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,150 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 13:23:39,151 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 13:23:39,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,194 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 13:23:39,194 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 13:23:39,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,247 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 13:23:39,248 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 13:23:39,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 13:23:39,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,287 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 13:23:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,288 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 13:23:39,289 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 13:23:39,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,328 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 13:23:39,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,344 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 13:23:39,361 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 13:23:39,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,424 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 13:23:39,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,425 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 13:23:39,426 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 13:23:39,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,472 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 13:23:39,473 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 13:23:39,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 13:23:39,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,536 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 13:23:39,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 13:23:39,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,566 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 13:23:39,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,609 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 13:23:39,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,622 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 13:23:39,624 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 13:23:39,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,704 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 13:23:39,705 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 13:23:39,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,760 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 13:23:39,761 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 13:23:39,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 13:23:39,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,814 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 13:23:39,816 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 13:23:39,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:39,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:39,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:39,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:39,923 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 13:23:39,970 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 13:23:39,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:39,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:39,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:39,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:39,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:39,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:39,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:39,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:40,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:40,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:40,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:40,011 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 13:23:40,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:40,027 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 13:23:40,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:40,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:40,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:40,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:40,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:40,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:40,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:40,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:40,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:40,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:40,075 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 13:23:40,133 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 13:23:40,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:40,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:40,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:23:40,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:40,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:40,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:40,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:23:40,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:23:40,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:40,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:40,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:40,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:40,172 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 13:23:40,173 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 13:23:40,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:40,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:40,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:40,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:40,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:40,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:40,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:40,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:40,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:40,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:40,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:40,234 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 13:23:40,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:40,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:40,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:40,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:40,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:40,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:40,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:40,265 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 13:23:40,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:40,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 13:23:40,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:40,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:40,324 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 13:23:40,344 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 13:23:40,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:40,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:40,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:40,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:40,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:40,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:40,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:40,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:40,407 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 13:23:40,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:40,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:40,409 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 13:23:40,410 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 13:23:40,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:40,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:40,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:40,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:40,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:40,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:40,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:40,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:23:40,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-26 13:23:40,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:40,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:40,475 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 13:23:40,477 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 13:23:40,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:23:40,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:23:40,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:23:40,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:23:40,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:23:40,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:23:40,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:23:40,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:23:40,568 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-26 13:23:40,568 INFO L444 ModelExtractionUtils]: 13 out of 25 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-26 13:23:40,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:23:40,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:23:40,570 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 13:23:40,634 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 13:23:40,635 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:23:40,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:23:40,653 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:23:40,653 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~len~0, thrThread1of3ForFork0_~c~0#1) = 1*~len~0 - 1*thrThread1of3ForFork0_~c~0#1 Supporting invariants [] [2022-07-26 13:23:40,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-26 13:23:40,689 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-26 13:23:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:23:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:23:40,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:23:40,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:23:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:23:40,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 13:23:40,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:23:40,984 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 13:23:40,989 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-26 13:23:40,991 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 207235 states and 843150 transitions. cyclomatic complexity: 654902 Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 13:23:41,324 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 13:23:48,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 207235 states and 843150 transitions. cyclomatic complexity: 654902. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 343200 states and 1496506 transitions. Complement of second has 10 states. [2022-07-26 13:23:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-26 13:23:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 13:23:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 470 transitions. [2022-07-26 13:23:48,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 470 transitions. Stem has 50 letters. Loop has 9 letters. [2022-07-26 13:23:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:23:48,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 470 transitions. Stem has 59 letters. Loop has 9 letters. [2022-07-26 13:23:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:23:48,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 470 transitions. Stem has 50 letters. Loop has 18 letters. [2022-07-26 13:23:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:23:48,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 343200 states and 1496506 transitions. [2022-07-26 13:23:59,493 INFO L131 ngComponentsAnalysis]: Automaton has 21760 accepting balls. 121856 [2022-07-26 13:24:06,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 343200 states to 310826 states and 1326689 transitions. [2022-07-26 13:24:06,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220179 [2022-07-26 13:24:07,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246077 [2022-07-26 13:24:07,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 310826 states and 1326689 transitions. [2022-07-26 13:24:07,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:24:07,666 INFO L220 hiAutomatonCegarLoop]: Abstraction has 310826 states and 1326689 transitions. [2022-07-26 13:24:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310826 states and 1326689 transitions. [2022-07-26 13:24:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310826 to 278458. [2022-07-26 13:24:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278458 states, 278458 states have (on average 4.271757320673135) internal successors, (1189505), 278457 states have internal predecessors, (1189505), 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 13:24:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278458 states to 278458 states and 1189505 transitions. [2022-07-26 13:24:24,515 INFO L242 hiAutomatonCegarLoop]: Abstraction has 278458 states and 1189505 transitions. [2022-07-26 13:24:24,515 INFO L426 stractBuchiCegarLoop]: Abstraction has 278458 states and 1189505 transitions. [2022-07-26 13:24:24,515 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:24:24,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278458 states and 1189505 transitions. [2022-07-26 13:24:28,850 INFO L131 ngComponentsAnalysis]: Automaton has 21760 accepting balls. 121856 [2022-07-26 13:24:28,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:24:28,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:24:28,860 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:24:28,860 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:24:28,865 INFO L733 eck$LassoCheckResult]: Stem: 2199286#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2199288#[L-1]don't care [461] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 1750220#[L-1-1]don't care [485] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 1750222#[L-1-2]don't care [486] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 2216986#[L991]don't care [425] L991-->L991-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 1744272#[L991-1]don't care [487] L991-1-->L991-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 1744274#[L991-2]don't care [457] L991-2-->L991-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 2219658#[L991-3]don't care [455] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 2219442#[L991-4]don't care [459] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 2219444#[L1006]don't care [491] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 2217408#[L1007]don't care [427] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 2217410#[L1008]don't care [445] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 2184282#[L-1-3]don't care [488] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2184284#[L-1-4]don't care [472] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2131682#[L-1-5]don't care [439] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1780432#[L-1-6]don't care [471] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 1780434#[L1039]don't care [420] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 2168472#[L1039-1]don't care [452] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 2220748#[L1041]don't care [465] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 2173830#[L1042]don't care [434] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 2173832#[L1042-1]don't care [489] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 2189012#[L1043]don't care [476] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2189014#[L1043-1]don't care [423] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2242960#[L1043-2]don't care [467] L1043-2-->L993: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2242962#[L993]don't care [480] L993-->L994: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2075650#[L994]don't care [475] L994-->L993-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 2075652#[L993-1]don't care [462] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2226734#[L1044]don't care [416] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 2206606#[L1044-1]don't care [438] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 2159962#[L1044-2]don't care [470] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 2103986#[L1045-2]don't care [430] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2103988#[L1046]don't care [492] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 2227650#[L1046-1]don't care [447] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 2227652#[L1046-2]don't care [454] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 2220876#[L1046-3]don't care [593] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of3ForFork0_thidvar1_2 0) (= v_thrThread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_22|) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1] 2192194#[L1046-4, thrENTRY]don't care [456] L1046-4-->L1046-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 2192196#[L1046-5, thrENTRY]don't care [448] L1046-5-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 2225062#[thrENTRY, L1045-2]don't care [430] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1801100#[L1046, thrENTRY]don't care [492] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 1801102#[thrENTRY, L1046-1]don't care [447] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1973332#[L1046-2, thrENTRY]don't care [454] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 1973334#[L1046-3, thrENTRY]don't care [594] L1046-3-->thrENTRY: Formula: (and (= v_thrThread2of3ForFork0_thidvar1_2 0) (= |v_thrThread2of3ForFork0_#in~arg#1.offset_4| 0) (= |v_thrThread2of3ForFork0_#in~arg#1.base_4| 0) (= v_thrThread2of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_24|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_24|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_10|, thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_4|, thrThread2of3ForFork0_thidvar1=v_thrThread2of3ForFork0_thidvar1_2, thrThread2of3ForFork0_thidvar0=v_thrThread2of3ForFork0_thidvar0_2, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_14|, thrThread2of3ForFork0_~arg#1.offset=|v_thrThread2of3ForFork0_~arg#1.offset_4|, thrThread2of3ForFork0_#res#1.offset=|v_thrThread2of3ForFork0_#res#1.offset_4|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_4|, thrThread2of3ForFork0_~arg#1.base=|v_thrThread2of3ForFork0_~arg#1.base_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_24|, thrThread2of3ForFork0_#res#1.base=|v_thrThread2of3ForFork0_#res#1.base_4|, thrThread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_6|, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_20|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_6|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_#in~arg#1.base, thrThread2of3ForFork0_thidvar1, thrThread2of3ForFork0_thidvar0, thrThread2of3ForFork0_~end~0#1, thrThread2of3ForFork0_~arg#1.offset, thrThread2of3ForFork0_#res#1.offset, thrThread2of3ForFork0_#in~arg#1.offset, thrThread2of3ForFork0_~arg#1.base, thrThread2of3ForFork0_#res#1.base, thrThread2of3ForFork0_assume_abort_if_not_~cond#1, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of3ForFork0_~c~0#1, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1] 2239212#[thrENTRY, thrENTRY, L1046-4]don't care [559] thrENTRY-->L1022: Formula: (and (= |v_thrThread2of3ForFork0_~arg#1.offset_1| |v_thrThread2of3ForFork0_#in~arg#1.offset_1|) (= |v_thrThread2of3ForFork0_~arg#1.base_1| |v_thrThread2of3ForFork0_#in~arg#1.base_1|)) InVars {thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_1|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread2of3ForFork0_~arg#1.offset=|v_thrThread2of3ForFork0_~arg#1.offset_1|, thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_1|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_1|, thrThread2of3ForFork0_~arg#1.base=|v_thrThread2of3ForFork0_~arg#1.base_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~arg#1.offset, thrThread2of3ForFork0_~arg#1.base] 2235424#[thrENTRY, L1022, L1046-4]don't care [560] L1022-->L1022-1: Formula: true InVars {} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1] 2235426#[thrENTRY, L1022-1, L1046-4]don't care [561] L1022-1-->L1023: Formula: true InVars {} OutVars{thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1] 2235178#[thrENTRY, L1023, L1046-4]don't care [562] L1023-->L1024: Formula: (= |v_thrThread2of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1] 1961460#[thrENTRY, L1024, L1046-4]don't care [563] L1024-->L1025: Formula: (= |v_thrThread2of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1] 1961462#[thrENTRY, L1025, L1046-4]don't care [564] L1025-->L1010: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2234144#[thrENTRY, L1010, L1046-4]don't care [565] L1010-->L1013: Formula: (and (= |v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_1| |v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~lock~0_23 1) (not (= |v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (= v_~lock~0_24 0) 1 0) |v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_1|)) InVars {~lock~0=v_~lock~0_24} OutVars{thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_1|, ~lock~0=v_~lock~0_23, thrThread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~lock~0, thrThread2of3ForFork0_assume_abort_if_not_~cond#1, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1] 2223892#[thrENTRY, L1013, L1046-4]don't care [566] L1013-->L1026: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2223894#[thrENTRY, L1026, L1046-4]don't care [568] L1026-->L1026-2: Formula: (not (<= (+ v_~next~0_7 10) v_~len~0_6)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[] 2224468#[thrENTRY, L1026-2, L1046-4]don't care [570] L1026-2-->L1016: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2239194#[thrENTRY, L1016, L1046-4]don't care [572] L1016-->L1019: Formula: (and (not (= |v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_3| |v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_3|) (= v_~lock~0_29 0) (= (ite (= v_~lock~0_30 1) 1 0) |v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~lock~0=v_~lock~0_30} OutVars{thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_3|, ~lock~0=v_~lock~0_29, thrThread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[~lock~0, thrThread2of3ForFork0_assume_abort_if_not_~cond#1, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1] 1868148#[thrENTRY, L1019, L1046-4]don't care [574] L1019-->L1031-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1868152#[thrENTRY, L1031-2, L1046-4]don't care [2022-07-26 13:24:28,866 INFO L735 eck$LassoCheckResult]: Loop: 1868152#[thrENTRY, L1031-2, L1046-4]don't care [577] L1031-2-->L1032: Formula: (< |v_thrThread2of3ForFork0_~c~0#1_9| |v_thrThread2of3ForFork0_~end~0#1_11|) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_9|, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_11|} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_9|, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_11|} AuxVars[] AssignedVars[] 2242334#[thrENTRY, L1032, L1046-4]don't care [579] L1032-->L1032-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2242336#[thrENTRY, L1032-1, L1046-4]don't care [581] L1032-1-->L1032-2: Formula: (= (ite (and (<= 0 |v_thrThread2of3ForFork0_~c~0#1_11|) (< |v_thrThread2of3ForFork0_~c~0#1_11| v_~len~0_7)) 1 0) |v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_11|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1] 2239998#[thrENTRY, L1032-2, L1046-4]don't care [582] L1032-2-->L996: Formula: true InVars {} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1] 1959848#[thrENTRY, L996, L1046-4]don't care [583] L996-->L997: Formula: (= |v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1] 1959850#[thrENTRY, L997, L1046-4]don't care [585] L997-->L997-2: Formula: (not (= |v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] 2237524#[thrENTRY, L997-2, L1046-4]don't care [587] L997-2-->L1033: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1760980#[thrENTRY, L1033, L1046-4]don't care [589] L1033-->L1033-1: Formula: (let ((.cse1 (* |v_thrThread2of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_8| v_~data~0.base_3)) (= (store |v_#memory_int_6| v_~data~0.base_3 (store (select |v_#memory_int_6| v_~data~0.base_3) .cse0 0)) |v_#memory_int_5|) (= (select |v_#valid_11| v_~data~0.base_3) 1)))) InVars {~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, ~data~0.offset=v_~data~0.offset_3, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} OutVars{~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ~data~0.offset=v_~data~0.offset_3, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 1760984#[thrENTRY, L1033-1, L1046-4]don't care [590] L1033-1-->L1031-2: Formula: (= |v_thrThread2of3ForFork0_~c~0#1_16| (+ |v_thrThread2of3ForFork0_~c~0#1_15| 1)) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_15|} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1] 1868152#[thrENTRY, L1031-2, L1046-4]don't care [2022-07-26 13:24:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:24:28,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1477732982, now seen corresponding path program 1 times [2022-07-26 13:24:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:24:28,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318770257] [2022-07-26 13:24:28,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:24:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:24:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:24:28,923 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:24:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:24:28,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:24:28,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:24:28,946 INFO L85 PathProgramCache]: Analyzing trace with hash 631466950, now seen corresponding path program 1 times [2022-07-26 13:24:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:24:28,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977389537] [2022-07-26 13:24:28,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:24:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:24:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:24:28,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:24:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:24:28,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:24:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:24:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1338179491, now seen corresponding path program 1 times [2022-07-26 13:24:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:24:28,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498149228] [2022-07-26 13:24:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:24:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:24:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:24:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-26 13:24:29,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:24:29,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498149228] [2022-07-26 13:24:29,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498149228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:24:29,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:24:29,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 13:24:29,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597556199] [2022-07-26 13:24:29,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:24:29,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:24:29,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:24:29,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:24:29,143 INFO L87 Difference]: Start difference. First operand 278458 states and 1189505 transitions. cyclomatic complexity: 936154 Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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)