/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:14:27,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:14:27,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:14:27,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:14:27,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:14:27,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:14:27,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:14:27,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:14:27,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:14:27,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:14:27,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:14:27,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:14:27,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:14:27,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:14:27,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:14:27,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:14:27,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:14:27,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:14:27,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:14:27,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:14:27,760 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:14:27,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:14:27,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:14:27,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:14:27,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:14:27,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:14:27,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:14:27,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:14:27,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:14:27,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:14:27,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:14:27,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:14:27,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:14:27,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:14:27,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:14:27,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:14:27,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:14:27,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:14:27,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:14:27,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:14:27,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:14:27,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:14:27,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:14:27,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:14:27,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:14:27,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:14:27,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:14:27,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:14:27,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:14:27,802 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:14:27,802 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:14:27,802 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:14:27,802 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:14:27,802 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:14:27,802 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:14:27,803 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:14:27,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:14:27,804 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:14:27,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:14:27,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:14:27,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:14:27,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:14:27,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:14:27,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:14:27,805 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:14:27,806 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:14:27,806 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-26 14:14:28,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:14:28,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:14:28,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:14:28,031 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:14:28,033 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:14:28,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-07-26 14:14:28,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3cb1bc6/e97a3738dc5a4dbf9c8e8dc53d3d6b3e/FLAGb418044ce [2022-07-26 14:14:28,478 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:14:28,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-07-26 14:14:28,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3cb1bc6/e97a3738dc5a4dbf9c8e8dc53d3d6b3e/FLAGb418044ce [2022-07-26 14:14:28,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3cb1bc6/e97a3738dc5a4dbf9c8e8dc53d3d6b3e [2022-07-26 14:14:28,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:14:28,499 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:14:28,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:14:28,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:14:28,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:14:28,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5b9546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28, skipping insertion in model container [2022-07-26 14:14:28,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:14:28,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:14:28,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-07-26 14:14:28,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:14:28,711 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:14:28,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-07-26 14:14:28,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:14:28,757 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:14:28,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28 WrapperNode [2022-07-26 14:14:28,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:14:28,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:14:28,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:14:28,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:14:28,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,799 INFO L137 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2022-07-26 14:14:28,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:14:28,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:14:28,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:14:28,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:14:28,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:14:28,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:14:28,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:14:28,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:14:28,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (1/1) ... [2022-07-26 14:14:28,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:28,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:28,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:28,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 14:14:28,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:14:28,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:14:28,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:14:28,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:14:28,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:14:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:14:28,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:14:28,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:14:28,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:14:28,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:14:28,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:14:28,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:14:28,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:14:28,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:14:28,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:14:28,992 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:14:29,098 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:14:29,099 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:14:29,337 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:14:29,423 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:14:29,426 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 14:14:29,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:14:29 BoogieIcfgContainer [2022-07-26 14:14:29,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:14:29,429 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:14:29,429 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:14:29,432 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:14:29,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:14:29,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:14:28" (1/3) ... [2022-07-26 14:14:29,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@481123b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:14:29, skipping insertion in model container [2022-07-26 14:14:29,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:14:29,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:28" (2/3) ... [2022-07-26 14:14:29,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@481123b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:14:29, skipping insertion in model container [2022-07-26 14:14:29,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:14:29,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:14:29" (3/3) ... [2022-07-26 14:14:29,434 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-07-26 14:14:29,521 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:14:29,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 118 transitions, 252 flow [2022-07-26 14:14:29,587 INFO L129 PetriNetUnfolder]: 9/114 cut-off events. [2022-07-26 14:14:29,587 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:14:29,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 9/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-26 14:14:29,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 118 transitions, 252 flow [2022-07-26 14:14:29,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 114 transitions, 240 flow [2022-07-26 14:14:29,600 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:14:29,608 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 114 transitions, 240 flow [2022-07-26 14:14:29,613 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 114 transitions, 240 flow [2022-07-26 14:14:29,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 114 transitions, 240 flow [2022-07-26 14:14:29,641 INFO L129 PetriNetUnfolder]: 9/114 cut-off events. [2022-07-26 14:14:29,641 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:14:29,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 9/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-26 14:14:29,643 INFO L116 LiptonReduction]: Number of co-enabled transitions 572 [2022-07-26 14:14:32,454 INFO L131 LiptonReduction]: Checked pairs total: 874 [2022-07-26 14:14:32,454 INFO L133 LiptonReduction]: Total number of compositions: 113 [2022-07-26 14:14:32,466 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:14:32,466 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:14:32,466 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:14:32,466 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:14:32,466 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:14:32,466 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:14:32,466 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:14:32,467 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:14:32,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:14:32,489 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 33 [2022-07-26 14:14:32,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:14:32,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:14:32,493 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:14:32,493 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:14:32,493 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:14:32,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 52 states, but on-demand construction may add more states [2022-07-26 14:14:32,496 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 33 [2022-07-26 14:14:32,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:14:32,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:14:32,496 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:14:32,496 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:14:32,499 INFO L733 eck$LassoCheckResult]: Stem: 117#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 120#[L97-6]don't care [2022-07-26 14:14:32,500 INFO L735 eck$LassoCheckResult]: Loop: 120#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (= |v_#memory_int_81| (store |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (select |v_#valid_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_82|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_81|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 120#[L97-6]don't care [2022-07-26 14:14:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:32,503 INFO L85 PathProgramCache]: Analyzing trace with hash 573, now seen corresponding path program 1 times [2022-07-26 14:14:32,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:32,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667309534] [2022-07-26 14:14:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:32,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:32,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:32,659 INFO L85 PathProgramCache]: Analyzing trace with hash 558, now seen corresponding path program 1 times [2022-07-26 14:14:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:32,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216366917] [2022-07-26 14:14:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:32,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:32,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 18290, now seen corresponding path program 1 times [2022-07-26 14:14:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:32,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861840138] [2022-07-26 14:14:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:32,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:32,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:33,204 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:14:33,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:14:33,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:14:33,204 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:14:33,204 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:14:33,204 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:33,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:14:33,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:14:33,205 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:14:33,205 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:14:33,205 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:14:33,219 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,222 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,224 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,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 14:14:33,228 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,230 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,232 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,233 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,236 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,237 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,239 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,240 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,472 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,474 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,476 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,478 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,480 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,482 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,484 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,486 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,488 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,492 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,494 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,495 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,497 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,498 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,500 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,501 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:33,856 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:14:33,860 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:14:33,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:33,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:33,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:33,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:33,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:33,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:33,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:33,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:33,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:33,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:33,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-26 14:14:33,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:33,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:33,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:33,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:33,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-26 14:14:33,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:33,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:33,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:33,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:33,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:33,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:33,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:33,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:33,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:33,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:33,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:33,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:33,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:33,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-26 14:14:33,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:33,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:33,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:33,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:33,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:33,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:33,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:34,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-26 14:14:34,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:34,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:34,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:34,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,063 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-26 14:14:34,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:34,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:34,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:34,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:34,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-26 14:14:34,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:34,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:34,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:34,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-26 14:14:34,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-26 14:14:34,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:34,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:34,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:34,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:34,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,159 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-26 14:14:34,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:34,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:34,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:34,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-26 14:14:34,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:34,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:34,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:34,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-26 14:14:34,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,223 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-26 14:14:34,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:34,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:34,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-26 14:14:34,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,267 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-26 14:14:34,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:34,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:34,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:34,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-26 14:14:34,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,292 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-26 14:14:34,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:34,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:34,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:34,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,322 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-26 14:14:34,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:34,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:34,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-26 14:14:34,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,359 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-26 14:14:34,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:34,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:34,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:34,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:34,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,401 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-26 14:14:34,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:34,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:34,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:34,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:34,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:34,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:34,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:34,431 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:14:34,466 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-26 14:14:34,467 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-26 14:14:34,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:34,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:34,469 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:34,470 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:14:34,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-26 14:14:34,516 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:14:34,516 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:14:34,517 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-26 14:14:34,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:34,582 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-26 14:14:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:14:34,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:14:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:14:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:14:34,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:14:34,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:14:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:14:34,659 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:14:34,660 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 52 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:34,729 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 52 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 104 states and 236 transitions. Complement of second has 5 states. [2022-07-26 14:14:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:14:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-07-26 14:14:34,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:14:34,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:34,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:14:34,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:34,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:14:34,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:34,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 236 transitions. [2022-07-26 14:14:34,740 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2022-07-26 14:14:34,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 48 states and 109 transitions. [2022-07-26 14:14:34,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-26 14:14:34,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-07-26 14:14:34,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 109 transitions. [2022-07-26 14:14:34,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:14:34,744 INFO L220 hiAutomatonCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-26 14:14:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 109 transitions. [2022-07-26 14:14:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-26 14:14:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 47 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 109 transitions. [2022-07-26 14:14:34,772 INFO L242 hiAutomatonCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-26 14:14:34,772 INFO L426 stractBuchiCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-26 14:14:34,772 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:14:34,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 109 transitions. [2022-07-26 14:14:34,778 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2022-07-26 14:14:34,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:14:34,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:14:34,778 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:14:34,778 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:14:34,778 INFO L733 eck$LassoCheckResult]: Stem: 491#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 429#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 431#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 485#[thread1ENTRY, L81-4]don't care [400] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 475#[L49-4, L81-4]don't care [2022-07-26 14:14:34,780 INFO L735 eck$LassoCheckResult]: Loop: 475#[L49-4, L81-4]don't care [430] L49-4-->L52: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_15| 4))) (let ((.cse0 (+ .cse2 v_~A~0.offset_27)) (.cse1 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|))) (and (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0))) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| v_~counter~0_29) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| |v_thread1Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| .cse1) (<= (+ .cse2 v_~A~0.offset_27 4) (select |v_#length_38| v_~A~0.base_27)) (= (select |v_#valid_43| v_~A~0.base_27) 1) (= (select (select |v_#memory_int_35| v_~A~0.base_27) .cse0) |v_thread1Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_~tmp~0#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (< |v_thread1Thread1of1ForFork0_~i~0#1_15| v_~N~0_8)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~N~0=v_~N~0_8} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_7|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] 479#[L52, L81-4]don't care [519] L52-->L49-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_29| (+ |v_thread1Thread1of1ForFork0_~i~0#1_30| 1)) (= |v_thread1Thread1of1ForFork0_~tmp~0#1_11| v_~counter~0_45)) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_30|} OutVars{~counter~0=v_~counter~0_45, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1] 475#[L49-4, L81-4]don't care [2022-07-26 14:14:34,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash 17594078, now seen corresponding path program 1 times [2022-07-26 14:14:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:34,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023698718] [2022-07-26 14:14:34,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:34,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:34,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:34,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash 14810, now seen corresponding path program 1 times [2022-07-26 14:14:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:34,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809140961] [2022-07-26 14:14:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:34,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:34,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:34,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:34,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:34,881 INFO L85 PathProgramCache]: Analyzing trace with hash -271946377, now seen corresponding path program 1 times [2022-07-26 14:14:34,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:34,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960672798] [2022-07-26 14:14:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:14:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:14:34,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:14:34,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960672798] [2022-07-26 14:14:34,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960672798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:14:34,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:14:34,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 14:14:34,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747703739] [2022-07-26 14:14:34,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:14:35,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:14:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:14:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:14:35,096 INFO L87 Difference]: Start difference. First operand 48 states and 109 transitions. cyclomatic complexity: 76 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:14:35,182 INFO L93 Difference]: Finished difference Result 83 states and 179 transitions. [2022-07-26 14:14:35,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 179 transitions. [2022-07-26 14:14:35,186 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 48 [2022-07-26 14:14:35,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 79 states and 171 transitions. [2022-07-26 14:14:35,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-26 14:14:35,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-26 14:14:35,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 171 transitions. [2022-07-26 14:14:35,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:14:35,193 INFO L220 hiAutomatonCegarLoop]: Abstraction has 79 states and 171 transitions. [2022-07-26 14:14:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 171 transitions. [2022-07-26 14:14:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2022-07-26 14:14:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.276923076923077) internal successors, (148), 64 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 148 transitions. [2022-07-26 14:14:35,205 INFO L242 hiAutomatonCegarLoop]: Abstraction has 65 states and 148 transitions. [2022-07-26 14:14:35,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:14:35,206 INFO L426 stractBuchiCegarLoop]: Abstraction has 65 states and 148 transitions. [2022-07-26 14:14:35,206 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:14:35,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 148 transitions. [2022-07-26 14:14:35,209 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 40 [2022-07-26 14:14:35,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:14:35,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:14:35,209 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:14:35,209 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:14:35,210 INFO L733 eck$LassoCheckResult]: Stem: 692#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 620#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (= |v_#memory_int_81| (store |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (select |v_#valid_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_82|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_81|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 624#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 626#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 730#[thread1ENTRY, L81-4]don't care [400] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 718#[L49-4, L81-4]don't care [2022-07-26 14:14:35,210 INFO L735 eck$LassoCheckResult]: Loop: 718#[L49-4, L81-4]don't care [430] L49-4-->L52: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_15| 4))) (let ((.cse0 (+ .cse2 v_~A~0.offset_27)) (.cse1 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|))) (and (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0))) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| v_~counter~0_29) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| |v_thread1Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| .cse1) (<= (+ .cse2 v_~A~0.offset_27 4) (select |v_#length_38| v_~A~0.base_27)) (= (select |v_#valid_43| v_~A~0.base_27) 1) (= (select (select |v_#memory_int_35| v_~A~0.base_27) .cse0) |v_thread1Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_~tmp~0#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (< |v_thread1Thread1of1ForFork0_~i~0#1_15| v_~N~0_8)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~N~0=v_~N~0_8} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_7|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] 716#[L52, L81-4]don't care [519] L52-->L49-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_29| (+ |v_thread1Thread1of1ForFork0_~i~0#1_30| 1)) (= |v_thread1Thread1of1ForFork0_~tmp~0#1_11| v_~counter~0_45)) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_30|} OutVars{~counter~0=v_~counter~0_45, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1] 718#[L49-4, L81-4]don't care [2022-07-26 14:14:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 545401225, now seen corresponding path program 1 times [2022-07-26 14:14:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:35,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537632111] [2022-07-26 14:14:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:35,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:35,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 14810, now seen corresponding path program 2 times [2022-07-26 14:14:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:35,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568511734] [2022-07-26 14:14:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:35,272 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:35,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:35,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:35,289 INFO L85 PathProgramCache]: Analyzing trace with hash 144580962, now seen corresponding path program 1 times [2022-07-26 14:14:35,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:35,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495355616] [2022-07-26 14:14:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:35,336 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:35,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:35,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-26 14:14:36,054 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:14:36,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:14:36,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:14:36,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:14:36,054 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:14:36,054 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:36,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:14:36,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:14:36,054 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 14:14:36,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:14:36,055 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:14:36,058 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,062 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,569 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,571 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,573 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,574 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,578 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,579 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,580 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,582 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,584 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,585 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,587 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,590 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,591 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,593 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,595 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,596 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,598 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,599 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,601 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,602 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,604 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,605 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,607 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,608 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,610 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,611 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:36,613 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:37,210 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:14:37,211 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:14:37,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,228 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-26 14:14:37,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:37,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:37,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:37,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:37,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-26 14:14:37,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,261 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-26 14:14:37,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:37,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:37,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:37,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:37,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,301 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-26 14:14:37,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:37,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:37,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:37,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-26 14:14:37,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,333 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-26 14:14:37,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:37,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:37,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:37,362 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 14:14:37,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,363 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:37,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:37,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-26 14:14:37,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:37,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-26 14:14:37,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,401 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-26 14:14:37,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:37,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:37,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:37,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-26 14:14:37,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,440 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-26 14:14:37,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:37,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:37,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:37,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-26 14:14:37,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,474 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-26 14:14:37,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:37,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:37,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:37,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-26 14:14:37,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,516 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-26 14:14:37,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:37,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:37,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:37,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:37,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:37,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:37,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:37,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:14:37,572 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-07-26 14:14:37,572 INFO L444 ModelExtractionUtils]: 12 out of 37 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-07-26 14:14:37,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:37,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:37,573 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:37,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-26 14:14:37,575 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:14:37,596 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:14:37,596 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:14:37,596 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_~i~0#1, ~N~0) = -1*thread1Thread1of1ForFork0_~i~0#1 + 1*~N~0 Supporting invariants [] [2022-07-26 14:14:37,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-26 14:14:37,675 INFO L156 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2022-07-26 14:14:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:14:37,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:14:37,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:14:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:14:37,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:14:37,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:14:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:14:37,726 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-26 14:14:37,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 148 transitions. cyclomatic complexity: 102 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:37,767 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 148 transitions. cyclomatic complexity: 102. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 161 states and 459 transitions. Complement of second has 6 states. [2022-07-26 14:14:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-26 14:14:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-07-26 14:14:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-26 14:14:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-26 14:14:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-26 14:14:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:37,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 459 transitions. [2022-07-26 14:14:37,770 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2022-07-26 14:14:37,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 122 states and 326 transitions. [2022-07-26 14:14:37,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-26 14:14:37,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2022-07-26 14:14:37,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 326 transitions. [2022-07-26 14:14:37,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:14:37,772 INFO L220 hiAutomatonCegarLoop]: Abstraction has 122 states and 326 transitions. [2022-07-26 14:14:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 326 transitions. [2022-07-26 14:14:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2022-07-26 14:14:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 2.808988764044944) internal successors, (250), 88 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 250 transitions. [2022-07-26 14:14:37,776 INFO L242 hiAutomatonCegarLoop]: Abstraction has 89 states and 250 transitions. [2022-07-26 14:14:37,776 INFO L426 stractBuchiCegarLoop]: Abstraction has 89 states and 250 transitions. [2022-07-26 14:14:37,776 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:14:37,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 250 transitions. [2022-07-26 14:14:37,777 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2022-07-26 14:14:37,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:14:37,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:14:37,777 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:14:37,777 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:14:37,778 INFO L733 eck$LassoCheckResult]: Stem: 1152#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1054#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 1056#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 1176#[thread1ENTRY, L81-4]don't care [518] L81-4-->L82-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= (select |v_#valid_127| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= |v_#memory_int_75| (store |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_ULTIMATE.start_main_#t~pre11#1_19| |v_#pthreadsForks_26|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_76|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_75|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] 1208#[thread1ENTRY, L82-3]don't care [427] L82-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_14|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_4|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~ret6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1174#[thread1ENTRY, thread2ENTRY, L82-4]don't care [411] thread2ENTRY-->L62-4: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] 1156#[thread1ENTRY, L62-4, L82-4]don't care [2022-07-26 14:14:37,778 INFO L735 eck$LassoCheckResult]: Loop: 1156#[thread1ENTRY, L62-4, L82-4]don't care [463] L62-4-->L65: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_21|))) (let ((.cse1 (+ .cse0 v_~A~0.offset_31))) (and (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_~tmp~1#1_7|) (<= (+ .cse0 v_~A~0.offset_31 4) (select |v_#length_58| v_~A~0.base_31)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_5| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_5|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_5|)) 1 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| (+ (* (- 1) |v_thread2Thread1of1ForFork1_minus_~b#1_5|) |v_thread2Thread1of1ForFork1_minus_~a#1_5|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_5| |v_thread2Thread1of1ForFork1_minus_#in~b#1_5|) (<= 0 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_5| |v_thread2Thread1of1ForFork1_minus_#in~a#1_5|) (< |v_thread2Thread1of1ForFork1_~i~1#1_21| v_~N~0_18) (= v_~counter~0_35 |v_thread2Thread1of1ForFork1_minus_#in~a#1_5|) (= (select |v_#valid_69| v_~A~0.base_31) 1) (= (select (select |v_#memory_int_49| v_~A~0.base_31) .cse1) |v_thread2Thread1of1ForFork1_minus_#in~b#1_5|)))) InVars {~counter~0=v_~counter~0_35, ~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_49|, #length=|v_#length_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_21|, ~N~0=v_~N~0_18} OutVars{~counter~0=v_~counter~0_35, ~A~0.base=v_~A~0.base_31, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_21|, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~A~0.offset=v_~A~0.offset_31, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_49|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_7|, #length=|v_#length_58|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_#t~ret6#1] 1158#[thread1ENTRY, L65, L82-4]don't care [517] L65-->L62-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_30|) |v_thread2Thread1of1ForFork1_~i~1#1_29|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_9| v_~counter~0_43)) InVars {thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_9|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_30|} OutVars{~counter~0=v_~counter~0_43, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_9|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_29|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_~i~1#1] 1156#[thread1ENTRY, L62-4, L82-4]don't care [2022-07-26 14:14:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash -271833180, now seen corresponding path program 1 times [2022-07-26 14:14:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:37,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142869757] [2022-07-26 14:14:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:37,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:37,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:37,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:37,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash 15831, now seen corresponding path program 1 times [2022-07-26 14:14:37,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:37,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875646451] [2022-07-26 14:14:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:37,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:37,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash 761333946, now seen corresponding path program 1 times [2022-07-26 14:14:37,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:37,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566008660] [2022-07-26 14:14:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:14:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:14:37,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:14:37,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566008660] [2022-07-26 14:14:37,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566008660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:14:37,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:14:37,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 14:14:37,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833817880] [2022-07-26 14:14:37,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:14:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:14:37,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:14:37,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:14:37,997 INFO L87 Difference]: Start difference. First operand 89 states and 250 transitions. cyclomatic complexity: 182 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:14:38,045 INFO L93 Difference]: Finished difference Result 95 states and 248 transitions. [2022-07-26 14:14:38,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 248 transitions. [2022-07-26 14:14:38,046 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2022-07-26 14:14:38,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 72 states and 210 transitions. [2022-07-26 14:14:38,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2022-07-26 14:14:38,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-07-26 14:14:38,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 210 transitions. [2022-07-26 14:14:38,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:14:38,047 INFO L220 hiAutomatonCegarLoop]: Abstraction has 72 states and 210 transitions. [2022-07-26 14:14:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 210 transitions. [2022-07-26 14:14:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-26 14:14:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.9166666666666665) internal successors, (210), 71 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 210 transitions. [2022-07-26 14:14:38,050 INFO L242 hiAutomatonCegarLoop]: Abstraction has 72 states and 210 transitions. [2022-07-26 14:14:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:14:38,051 INFO L426 stractBuchiCegarLoop]: Abstraction has 72 states and 210 transitions. [2022-07-26 14:14:38,051 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:14:38,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 210 transitions. [2022-07-26 14:14:38,051 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2022-07-26 14:14:38,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:14:38,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:14:38,052 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:14:38,052 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:14:38,052 INFO L733 eck$LassoCheckResult]: Stem: 1433#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1335#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (= |v_#memory_int_81| (store |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (select |v_#valid_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_82|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_81|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 1337#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 1339#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 1425#[thread1ENTRY, L81-4]don't care [518] L81-4-->L82-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= (select |v_#valid_127| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= |v_#memory_int_75| (store |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_ULTIMATE.start_main_#t~pre11#1_19| |v_#pthreadsForks_26|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_76|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_75|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] 1427#[thread1ENTRY, L82-3]don't care [427] L82-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_14|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_4|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~ret6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1431#[thread1ENTRY, thread2ENTRY, L82-4]don't care [411] thread2ENTRY-->L62-4: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] 1435#[thread1ENTRY, L62-4, L82-4]don't care [2022-07-26 14:14:38,052 INFO L735 eck$LassoCheckResult]: Loop: 1435#[thread1ENTRY, L62-4, L82-4]don't care [463] L62-4-->L65: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_21|))) (let ((.cse1 (+ .cse0 v_~A~0.offset_31))) (and (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_~tmp~1#1_7|) (<= (+ .cse0 v_~A~0.offset_31 4) (select |v_#length_58| v_~A~0.base_31)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_5| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_5|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_5|)) 1 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| (+ (* (- 1) |v_thread2Thread1of1ForFork1_minus_~b#1_5|) |v_thread2Thread1of1ForFork1_minus_~a#1_5|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_5| |v_thread2Thread1of1ForFork1_minus_#in~b#1_5|) (<= 0 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_5| |v_thread2Thread1of1ForFork1_minus_#in~a#1_5|) (< |v_thread2Thread1of1ForFork1_~i~1#1_21| v_~N~0_18) (= v_~counter~0_35 |v_thread2Thread1of1ForFork1_minus_#in~a#1_5|) (= (select |v_#valid_69| v_~A~0.base_31) 1) (= (select (select |v_#memory_int_49| v_~A~0.base_31) .cse1) |v_thread2Thread1of1ForFork1_minus_#in~b#1_5|)))) InVars {~counter~0=v_~counter~0_35, ~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_49|, #length=|v_#length_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_21|, ~N~0=v_~N~0_18} OutVars{~counter~0=v_~counter~0_35, ~A~0.base=v_~A~0.base_31, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_21|, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~A~0.offset=v_~A~0.offset_31, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_49|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_7|, #length=|v_#length_58|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_#t~ret6#1] 1439#[thread1ENTRY, L65, L82-4]don't care [517] L65-->L62-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_30|) |v_thread2Thread1of1ForFork1_~i~1#1_29|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_9| v_~counter~0_43)) InVars {thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_9|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_30|} OutVars{~counter~0=v_~counter~0_43, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_9|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_29|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_~i~1#1] 1435#[thread1ENTRY, L62-4, L82-4]don't care [2022-07-26 14:14:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 144694159, now seen corresponding path program 1 times [2022-07-26 14:14:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:38,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271980061] [2022-07-26 14:14:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:38,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:38,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash 15831, now seen corresponding path program 2 times [2022-07-26 14:14:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:38,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367332263] [2022-07-26 14:14:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:38,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:38,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:38,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1612148197, now seen corresponding path program 1 times [2022-07-26 14:14:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:38,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316485311] [2022-07-26 14:14:38,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:38,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:38,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:38,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:39,049 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 14:14:39,107 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:14:39,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:14:39,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:14:39,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:14:39,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:14:39,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:39,107 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:14:39,107 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:14:39,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration5_Lasso [2022-07-26 14:14:39,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:14:39,108 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:14:39,110 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,112 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,113 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,115 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,116 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,117 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,119 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,120 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,122 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,123 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,124 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,126 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,127 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,129 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,130 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,131 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,133 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,134 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,135 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,137 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,139 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,140 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,144 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,145 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,146 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,148 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,149 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,151 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,152 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,154 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,155 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,157 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,692 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,694 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,695 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,696 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,698 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,699 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,701 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,702 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,703 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,705 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,706 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:39,709 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:40,289 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:14:40,289 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:14:40,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,292 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-26 14:14:40,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,330 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 14:14:40,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,331 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-26 14:14:40,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-26 14:14:40,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,384 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-26 14:14:40,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,414 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 14:14:40,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,415 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 14:14:40,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-26 14:14:40,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,450 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 14:14:40,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-26 14:14:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,489 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 14:14:40,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-26 14:14:40,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,529 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 14:14:40,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 14:14:40,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,568 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 14:14:40,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:40,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:40,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:40,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,596 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 14:14:40,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 14:14:40,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,635 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 14:14:40,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 14:14:40,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,675 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 14:14:40,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-26 14:14:40,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,700 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-26 14:14:40,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:40,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:40,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-26 14:14:40,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,741 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-26 14:14:40,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-26 14:14:40,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,766 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-26 14:14:40,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:40,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,824 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-26 14:14:40,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:40,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,863 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-26 14:14:40,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,887 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 14:14:40,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,888 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-26 14:14:40,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:40,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,927 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-26 14:14:40,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-26 14:14:40,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,962 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-26 14:14:40,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:40,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:40,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:40,987 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 14:14:40,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:40,988 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:40,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-26 14:14:40,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:40,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:40,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:40,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:40,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:40,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:40,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:40,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:40,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-26 14:14:41,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,014 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:41,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:41,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-26 14:14:41,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-26 14:14:41,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,049 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-26 14:14:41,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:41,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:41,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:41,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,078 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-26 14:14:41,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:41,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:41,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:41,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,102 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-26 14:14:41,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:41,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:41,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:41,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:41,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,141 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-26 14:14:41,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:41,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:41,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:41,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,166 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-26 14:14:41,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:41,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:41,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:41,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,190 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 14:14:41,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,192 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-26 14:14:41,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:41,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:41,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:41,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,221 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-26 14:14:41,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:41,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:41,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:41,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,276 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-26 14:14:41,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:41,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:41,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-26 14:14:41,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,324 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:14:41,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:14:41,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:14:41,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-26 14:14:41,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:41,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,395 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-26 14:14:41,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:14:41,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:41,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:41,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:14:41,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-26 14:14:41,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,425 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-26 14:14:41,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 14:14:41,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:14:41,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:14:41,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:14:41,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:14:41,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:14:41,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:14:41,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:14:41,479 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-26 14:14:41,479 INFO L444 ModelExtractionUtils]: 5 out of 40 variables were initially zero. Simplification set additionally 32 variables to zero. [2022-07-26 14:14:41,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:41,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:41,480 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:14:41,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-26 14:14:41,482 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:14:41,503 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:14:41,503 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:14:41,503 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread2Thread1of1ForFork1_~i~1#1) = 1*~N~0 - 1*thread2Thread1of1ForFork1_~i~1#1 Supporting invariants [] [2022-07-26 14:14:41,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-26 14:14:41,583 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-26 14:14:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:14:41,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:14:41,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:14:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:14:41,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:14:41,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:14:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:14:41,636 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-26 14:14:41,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 210 transitions. cyclomatic complexity: 155 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:41,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 210 transitions. cyclomatic complexity: 155. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 178 states and 526 transitions. Complement of second has 6 states. [2022-07-26 14:14:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-26 14:14:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:14:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-07-26 14:14:41,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-26 14:14:41,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:41,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 14:14:41,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:41,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-26 14:14:41,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:14:41,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 526 transitions. [2022-07-26 14:14:41,674 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:14:41,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 0 states and 0 transitions. [2022-07-26 14:14:41,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 14:14:41,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 14:14:41,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 14:14:41,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:14:41,675 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:14:41,675 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:14:41,675 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:14:41,675 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:14:41,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 14:14:41,675 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:14:41,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 14:14:41,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:14:41 BoogieIcfgContainer [2022-07-26 14:14:41,679 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:14:41,680 INFO L158 Benchmark]: Toolchain (without parser) took 13180.44ms. Allocated memory was 187.7MB in the beginning and 334.5MB in the end (delta: 146.8MB). Free memory was 129.7MB in the beginning and 261.3MB in the end (delta: -131.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-07-26 14:14:41,680 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:14:41,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.45ms. Allocated memory was 187.7MB in the beginning and 272.6MB in the end (delta: 84.9MB). Free memory was 129.4MB in the beginning and 243.1MB in the end (delta: -113.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-07-26 14:14:41,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.57ms. Allocated memory is still 272.6MB. Free memory was 243.1MB in the beginning and 241.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:14:41,680 INFO L158 Benchmark]: Boogie Preprocessor took 33.23ms. Allocated memory is still 272.6MB. Free memory was 241.0MB in the beginning and 239.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:14:41,680 INFO L158 Benchmark]: RCFGBuilder took 594.43ms. Allocated memory is still 272.6MB. Free memory was 239.5MB in the beginning and 215.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-07-26 14:14:41,681 INFO L158 Benchmark]: BuchiAutomizer took 12250.39ms. Allocated memory was 272.6MB in the beginning and 334.5MB in the end (delta: 61.9MB). Free memory was 215.9MB in the beginning and 261.3MB in the end (delta: -45.5MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2022-07-26 14:14:41,682 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.45ms. Allocated memory was 187.7MB in the beginning and 272.6MB in the end (delta: 84.9MB). Free memory was 129.4MB in the beginning and 243.1MB in the end (delta: -113.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.57ms. Allocated memory is still 272.6MB. Free memory was 243.1MB in the beginning and 241.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.23ms. Allocated memory is still 272.6MB. Free memory was 241.0MB in the beginning and 239.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 594.43ms. Allocated memory is still 272.6MB. Free memory was 239.5MB in the beginning and 215.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 12250.39ms. Allocated memory was 272.6MB in the beginning and 334.5MB in the end (delta: 61.9MB). Free memory was 215.9MB in the beginning and 261.3MB in the end (delta: -45.5MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 8.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 47 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 16 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital274 mio100 ax109 hnf100 lsp82 ukn81 mio100 lsp36 div124 bol100 ite100 ukn100 eq173 hnf91 smp86 dnf153 smp70 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 2.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 112 PlacesBefore, 23 PlacesAfterwards, 114 TransitionsBefore, 19 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 113 TotalNumberOfCompositions, 874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 679, positive: 641, positive conditional: 0, positive unconditional: 641, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 315, positive: 305, positive conditional: 0, positive unconditional: 305, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 679, positive: 336, positive conditional: 0, positive unconditional: 336, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 315, unknown conditional: 0, unknown unconditional: 315] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 RESULT: Ultimate proved your program to be correct! [2022-07-26 14:14:41,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-26 14:14:41,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...