/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 11:56:51,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:56:51,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:56:51,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:56:51,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:56:51,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:56:51,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:56:51,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:56:51,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:56:51,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:56:51,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:56:51,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:56:51,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:56:51,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:56:51,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:56:51,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:56:51,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:56:51,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:56:51,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:56:51,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:56:51,784 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:56:51,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:56:51,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:56:51,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:56:51,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:56:51,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:56:51,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:56:51,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:56:51,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:56:51,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:56:51,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:56:51,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:56:51,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:56:51,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:56:51,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:56:51,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:56:51,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:56:51,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:56:51,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:56:51,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:56:51,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:56:51,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:56:51,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 11:56:51,847 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:56:51,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:56:51,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:56:51,848 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:56:51,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:56:51,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:56:51,850 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:56:51,850 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 11:56:51,850 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 11:56:51,851 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 11:56:51,851 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 11:56:51,851 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 11:56:51,851 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 11:56:51,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:56:51,852 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:56:51,852 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 11:56:51,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:56:51,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:56:51,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:56:51,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 11:56:51,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 11:56:51,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 11:56:51,854 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:56:51,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:56:51,854 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 11:56:51,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:56:51,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 11:56:51,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:56:51,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:56:51,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:56:51,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:56:51,856 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:56:51,859 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 11:56:51,859 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-22 11:56:52,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:56:52,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:56:52,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:56:52,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:56:52,303 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:56:52,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-07-22 11:56:52,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/783666667/8fde119543944d8a97c0a422426a89cf/FLAG64d5c1383 [2022-07-22 11:56:53,053 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:56:53,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-07-22 11:56:53,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/783666667/8fde119543944d8a97c0a422426a89cf/FLAG64d5c1383 [2022-07-22 11:56:53,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/783666667/8fde119543944d8a97c0a422426a89cf [2022-07-22 11:56:53,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:56:53,364 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 11:56:53,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:56:53,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:56:53,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:56:53,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e6f5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53, skipping insertion in model container [2022-07-22 11:56:53,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:56:53,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:56:53,613 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-min-max-inc.wvr.c[3018,3031] [2022-07-22 11:56:53,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:56:53,629 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:56:53,661 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-min-max-inc.wvr.c[3018,3031] [2022-07-22 11:56:53,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:56:53,682 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:56:53,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53 WrapperNode [2022-07-22 11:56:53,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:56:53,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:56:53,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:56:53,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:56:53,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,734 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2022-07-22 11:56:53,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:56:53,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:56:53,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:56:53,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:56:53,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:56:53,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:56:53,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:56:53,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:56:53,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (1/1) ... [2022-07-22 11:56:53,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:53,827 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-22 11:56:53,837 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-22 11:56:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:56:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 11:56:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:56:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:56:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 11:56:53,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 11:56:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 11:56:53,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 11:56:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 11:56:53,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 11:56:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 11:56:53,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 11:56:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:56:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 11:56:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 11:56:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:56:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:56:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:56:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 11:56:53,892 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 11:56:53,997 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:56:53,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:56:54,554 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:56:54,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:56:54,778 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 11:56:54,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:56:54 BoogieIcfgContainer [2022-07-22 11:56:54,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:56:54,783 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 11:56:54,783 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 11:56:54,788 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 11:56:54,788 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:56:54,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 11:56:53" (1/3) ... [2022-07-22 11:56:54,790 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4876c52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:56:54, skipping insertion in model container [2022-07-22 11:56:54,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:56:54,791 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:56:53" (2/3) ... [2022-07-22 11:56:54,792 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4876c52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:56:54, skipping insertion in model container [2022-07-22 11:56:54,792 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:56:54,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:56:54" (3/3) ... [2022-07-22 11:56:54,794 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-07-22 11:56:54,991 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-22 11:56:55,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 173 transitions, 378 flow [2022-07-22 11:56:55,163 INFO L129 PetriNetUnfolder]: 12/165 cut-off events. [2022-07-22 11:56:55,163 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 11:56:55,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 165 events. 12/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-07-22 11:56:55,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 173 transitions, 378 flow [2022-07-22 11:56:55,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 165 transitions, 354 flow [2022-07-22 11:56:55,204 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:56:55,204 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:56:55,204 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:56:55,204 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:56:55,205 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:56:55,205 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:56:55,205 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:56:55,206 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:56:55,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:56:58,529 INFO L131 ngComponentsAnalysis]: Automaton has 2451 accepting balls. 22296 [2022-07-22 11:56:58,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:56:58,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:56:58,540 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:56:58,541 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:56:58,541 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:56:58,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 26149 states, but on-demand construction may add more states [2022-07-22 11:56:59,426 INFO L131 ngComponentsAnalysis]: Automaton has 2451 accepting balls. 22296 [2022-07-22 11:56:59,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:56:59,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:56:59,430 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:56:59,430 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:56:59,438 INFO L748 eck$LassoCheckResult]: Stem: 173#[ULTIMATE.startENTRY]don't care [453] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 176#[L-1]don't care [345] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 178#[L-1-1]don't care [463] L-1-1-->L-1-2: Formula: (= (select |v_#valid_18| 0) 0) InVars {#valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|} AuxVars[] AssignedVars[] 180#[L-1-2]don't care [465] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 182#[L21]don't care [424] L21-->L21-1: Formula: (and (= (select |v_#valid_19| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_19|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[] 184#[L21-1]don't care [449] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 186#[L21-2]don't care [357] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 188#[L21-3]don't care [408] L21-3-->L21-4: Formula: (and (= (select |v_#valid_20| 2) 1) (= (select |v_#length_11| 2) 25)) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 190#[L21-4]don't care [378] L21-4-->L42: Formula: (and (= v_~A~0.base_10 0) (= v_~A~0.offset_10 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_10, ~A~0.offset=v_~A~0.offset_10} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 192#[L42]don't care [365] L42-->L42-1: Formula: (= v_~min~0_7 0) InVars {} OutVars{~min~0=v_~min~0_7} AuxVars[] AssignedVars[~min~0] 194#[L42-1]don't care [451] L42-1-->L42-2: Formula: (= v_~max~0_7 0) InVars {} OutVars{~max~0=v_~max~0_7} AuxVars[] AssignedVars[~max~0] 196#[L42-2]don't care [375] L42-2-->L43: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0] 198#[L43]don't care [457] L43-->L43-1: Formula: (= v_~v_assert~0_2 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[~v_assert~0] 200#[L43-1]don't care [341] L43-1-->L43-2: Formula: (= v_~b1~0_3 0) InVars {} OutVars{~b1~0=v_~b1~0_3} AuxVars[] AssignedVars[~b1~0] 202#[L43-2]don't care [364] L43-2-->L-1-3: Formula: (= v_~b2~0_3 0) InVars {} OutVars{~b2~0=v_~b2~0_3} AuxVars[] AssignedVars[~b2~0] 204#[L-1-3]don't care [466] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 206#[L-1-4]don't care [354] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 208#[L-1-5]don't care [319] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 210#[L-1-6]don't care [439] L-1-6-->L103: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_1|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_1|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_1|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_1|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_1|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 212#[L103]don't care [452] L103-->L103-1: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_12|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_13|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 214#[L103-1]don't care [349] L103-1-->L103-2: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_14|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, #valid=|v_#valid_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 216#[L103-2]don't care [421] L103-2-->L103-3: Formula: (and (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_4|) (= (store |v_#length_17| |v_ULTIMATE.start_main_~#t3~0#1.base_4| 4) |v_#length_16|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_4| 0)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t3~0#1.base_4|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_4| 0) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t3~0#1.base_4| 1) |v_#valid_25|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_17|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_4|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 218#[L103-3]don't care [396] L103-3-->L103-4: Formula: (and (= |v_ULTIMATE.start_main_~#t4~0#1.offset_4| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t4~0#1.base_4| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_4| 0)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t4~0#1.base_4|) 0) (= (store |v_#length_19| |v_ULTIMATE.start_main_~#t4~0#1.base_4| 4) |v_#length_18|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_19|, #valid=|v_#valid_28|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_4|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_4|, #valid=|v_#valid_27|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 220#[L103-4]don't care [344] L103-4-->L105: Formula: (= |v_ULTIMATE.start_main_#t~nondet15#1_2| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0] 222#[L105]don't care [323] L105-->L106: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1] 224#[L106]don't care [450] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 226#[L106-1]don't care [440] L106-1-->L106-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~N~0_9) 1 0)) InVars {~N~0=v_~N~0_9} OutVars{~N~0=v_~N~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 228#[L106-2]don't care [361] L106-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 230#[L37]don't care [366] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 232#[L38]don't care [380] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 236#[L37-1]don't care [367] L37-1-->L107: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 238#[L107]don't care [461] L107-->L107-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 240#[L107-1]don't care [455] L107-1-->L107-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_10) InVars {~N~0=v_~N~0_10} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 242#[L107-2]don't care [383] L107-2-->L107-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 244#[L107-3]don't care [381] L107-3-->L125: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1] 246#[L125]don't care [410] L125-->L126: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 248#[L126]don't care [389] L126-->L126-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 250#[L126-1]don't care [360] L126-1-->L126-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 252#[L126-2]don't care [467] L126-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 254#[L37-2]don't care [324] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 256#[L38-3]don't care [343] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 260#[L37-3]don't care [338] L37-3-->L127: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 262#[L127]don't care [458] L127-->L127-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 264#[L127-1]don't care [413] L127-1-->L127-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 266#[L127-2]don't care [373] L127-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 268#[L37-4]don't care [438] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 270#[L38-6]don't care [420] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 274#[L37-5]don't care [404] L37-5-->L129: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 276#[L129]don't care [443] L129-->L129-1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_2| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| 0)) (= (store |v_#length_21| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_20|) (= (store |v_#valid_30| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| 1) |v_#valid_29|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| |v_#StackHeapBarrier_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2|, #valid=|v_#valid_29|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, #valid, #length] 278#[L129-1]don't care [350] L129-1-->L129-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 280#[L129-2]don't care [313] L129-2-->L130: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base] 282#[L130]don't care [368] L130-->L130-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 284#[L130-6]don't care [2022-07-22 11:56:59,439 INFO L750 eck$LassoCheckResult]: Loop: 284#[L130-6]don't care [448] L130-6-->L131: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 286#[L131]don't care [352] L131-->L131-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (select |v_#valid_31| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= (store |v_#memory_int_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_2|)) |v_#memory_int_13|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int] 290#[L131-1]don't care [422] L131-1-->L130-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet31#1] 294#[L130-3]don't care [312] L130-3-->L130-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1] 298#[L130-4]don't care [340] L130-4-->L130-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 302#[L130-5]don't care [445] L130-5-->L130-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1] 284#[L130-6]don't care [2022-07-22 11:56:59,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1775076104, now seen corresponding path program 1 times [2022-07-22 11:56:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:59,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610104726] [2022-07-22 11:56:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:59,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:59,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:59,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1166423452, now seen corresponding path program 1 times [2022-07-22 11:56:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:59,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374460772] [2022-07-22 11:56:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:59,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:59,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2098126163, now seen corresponding path program 1 times [2022-07-22 11:56:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:59,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786005472] [2022-07-22 11:56:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:59,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:00,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:02,370 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:02,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:02,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:02,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:02,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:57:02,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:02,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:02,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:02,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-min-max-inc.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 11:57:02,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:02,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:02,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,636 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:57:03,641 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:57:03,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,651 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-22 11:57:03,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:03,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:03,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:03,676 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-22 11:57:03,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 11:57:03,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,714 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-22 11:57:03,716 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-22 11:57:03,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,778 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-22 11:57:03,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,780 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-22 11:57:03,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:03,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:03,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:03,802 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-22 11:57:03,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,851 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-22 11:57:03,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,853 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-22 11:57:03,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,874 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-22 11:57:03,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,917 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-22 11:57:03,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,919 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-22 11:57:03,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,941 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-22 11:57:03,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,993 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-22 11:57:03,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,995 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-22 11:57:03,998 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-22 11:57:03,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,057 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-22 11:57:04,060 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-22 11:57:04,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:04,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:04,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:04,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,111 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-22 11:57:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,119 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-22 11:57:04,129 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-22 11:57:04,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,172 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-22 11:57:04,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,175 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-22 11:57:04,176 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-22 11:57:04,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,230 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-22 11:57:04,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,232 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-22 11:57:04,234 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-22 11:57:04,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,306 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-22 11:57:04,311 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-22 11:57:04,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,376 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-22 11:57:04,379 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-22 11:57:04,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,426 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-22 11:57:04,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,430 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-22 11:57:04,431 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-22 11:57:04,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,475 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-22 11:57:04,477 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-22 11:57:04,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,547 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-22 11:57:04,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,550 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-22 11:57:04,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:04,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:04,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:04,569 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-22 11:57:04,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,606 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-22 11:57:04,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,607 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-22 11:57:04,608 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-22 11:57:04,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:04,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:04,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:04,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,641 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-22 11:57:04,643 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-22 11:57:04,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,681 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-22 11:57:04,714 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-22 11:57:04,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:04,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:04,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:04,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,754 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-22 11:57:04,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,756 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-22 11:57:04,756 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-22 11:57:04,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:04,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:04,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:04,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,805 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-22 11:57:04,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,810 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-22 11:57:04,812 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-22 11:57:04,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:04,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:04,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:04,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,854 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-22 11:57:04,856 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-22 11:57:04,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,897 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-22 11:57:04,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,902 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-22 11:57:04,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:04,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:04,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:04,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,932 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-22 11:57:04,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,933 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-22 11:57:04,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:04,936 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-22 11:57:04,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:04,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:04,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:04,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:04,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:04,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:04,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:04,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:04,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:04,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:04,994 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-22 11:57:04,995 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-22 11:57:04,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:05,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:05,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:05,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,028 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-22 11:57:05,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,030 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-22 11:57:05,031 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-22 11:57:05,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,069 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-22 11:57:05,070 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-22 11:57:05,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,114 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-22 11:57:05,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,115 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-22 11:57:05,116 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-22 11:57:05,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:05,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:05,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:05,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 11:57:05,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,149 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-22 11:57:05,156 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-22 11:57:05,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:05,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:05,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:05,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,191 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-22 11:57:05,192 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-22 11:57:05,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:05,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:05,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:05,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,226 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-22 11:57:05,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,228 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-22 11:57:05,229 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-22 11:57:05,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,273 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-22 11:57:05,273 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-22 11:57:05,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,340 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-22 11:57:05,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:05,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:05,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:05,355 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-22 11:57:05,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,400 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-22 11:57:05,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-22 11:57:05,407 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-22 11:57:05,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,437 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-22 11:57:05,438 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-22 11:57:05,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:05,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:05,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:05,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,470 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-22 11:57:05,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,472 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-22 11:57:05,473 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-22 11:57:05,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,543 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-22 11:57:05,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,560 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-22 11:57:05,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,604 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-22 11:57:05,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,617 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-22 11:57:05,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:05,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:05,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:05,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,643 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-22 11:57:05,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,644 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-22 11:57:05,645 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-22 11:57:05,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:05,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:05,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:05,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,700 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-22 11:57:05,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,702 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-22 11:57:05,703 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-22 11:57:05,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:05,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,777 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-22 11:57:05,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,799 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-22 11:57:05,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 11:57:05,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,837 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-22 11:57:05,838 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-22 11:57:05,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,885 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-22 11:57:05,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,886 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-22 11:57:05,888 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-22 11:57:05,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-22 11:57:05,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 11:57:05,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,928 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-22 11:57:05,929 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-22 11:57:05,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:05,973 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-22 11:57:05,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:05,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:05,975 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-22 11:57:05,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:05,980 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-22 11:57:05,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:05,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:05,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:05,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:05,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:05,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:05,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:06,014 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-22 11:57:06,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:06,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:06,016 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-22 11:57:06,020 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-22 11:57:06,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:06,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:06,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:06,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:06,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:06,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:06,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:06,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:06,056 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-22 11:57:06,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:06,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:06,060 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-22 11:57:06,061 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-22 11:57:06,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:06,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:06,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:06,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:06,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:06,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:06,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:06,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:06,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:06,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:06,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:06,099 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-22 11:57:06,100 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-22 11:57:06,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:06,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:06,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:06,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:06,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:06,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:06,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:06,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:06,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:06,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:06,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:06,171 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-22 11:57:06,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:06,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:06,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:06,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:06,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:06,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:06,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:06,198 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-22 11:57:06,205 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:57:06,237 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 11:57:06,237 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 11:57:06,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:06,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:06,242 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-22 11:57:06,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:57:06,256 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-22 11:57:06,280 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 11:57:06,280 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:57:06,281 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 11:57:06,318 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-22 11:57:06,474 INFO L257 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2022-07-22 11:57:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:06,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:06,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:06,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:06,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:06,760 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-22 11:57:06,801 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:57:06,805 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 26149 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-22 11:57:07,353 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-22 11:57:08,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 26149 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 52283 states and 238252 transitions. Complement of second has 8 states. [2022-07-22 11:57:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:57:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-22 11:57:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2022-07-22 11:57:08,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 197 transitions. Stem has 52 letters. Loop has 6 letters. [2022-07-22 11:57:08,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:08,269 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:57:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:08,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:08,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:08,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:08,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:08,443 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-22 11:57:08,444 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:57:08,444 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 26149 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-22 11:57:09,640 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 26149 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 52277 states and 238245 transitions. Complement of second has 10 states. [2022-07-22 11:57:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:57:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-22 11:57:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2022-07-22 11:57:09,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 198 transitions. Stem has 52 letters. Loop has 6 letters. [2022-07-22 11:57:09,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:09,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 198 transitions. Stem has 58 letters. Loop has 6 letters. [2022-07-22 11:57:09,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:09,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 198 transitions. Stem has 52 letters. Loop has 12 letters. [2022-07-22 11:57:09,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:09,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52277 states and 238245 transitions. [2022-07-22 11:57:10,793 INFO L131 ngComponentsAnalysis]: Automaton has 2450 accepting balls. 22290 [2022-07-22 11:57:12,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52277 states to 25376 states and 115310 transitions. [2022-07-22 11:57:12,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25369 [2022-07-22 11:57:12,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25370 [2022-07-22 11:57:12,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25376 states and 115310 transitions. [2022-07-22 11:57:13,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:57:13,106 INFO L220 hiAutomatonCegarLoop]: Abstraction has 25376 states and 115310 transitions. [2022-07-22 11:57:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25376 states and 115310 transitions. [2022-07-22 11:57:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25376 to 25376. [2022-07-22 11:57:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25376 states, 25376 states have (on average 4.54405737704918) internal successors, (115310), 25375 states have internal predecessors, (115310), 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-22 11:57:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25376 states to 25376 states and 115310 transitions. [2022-07-22 11:57:15,076 INFO L242 hiAutomatonCegarLoop]: Abstraction has 25376 states and 115310 transitions. [2022-07-22 11:57:15,076 INFO L425 stractBuchiCegarLoop]: Abstraction has 25376 states and 115310 transitions. [2022-07-22 11:57:15,076 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:57:15,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25376 states and 115310 transitions. [2022-07-22 11:57:15,578 INFO L131 ngComponentsAnalysis]: Automaton has 2450 accepting balls. 22290 [2022-07-22 11:57:15,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:15,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:15,583 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:57:15,583 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:57:15,589 INFO L748 eck$LassoCheckResult]: Stem: 208005#[ULTIMATE.startENTRY]don't care [453] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 207607#[L-1]don't care [345] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 161415#[L-1-1]don't care [463] L-1-1-->L-1-2: Formula: (= (select |v_#valid_18| 0) 0) InVars {#valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|} AuxVars[] AssignedVars[] 161417#[L-1-2]don't care [465] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 170557#[L21]don't care [424] L21-->L21-1: Formula: (and (= (select |v_#valid_19| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_19|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[] 170559#[L21-1]don't care [449] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 207665#[L21-2]don't care [357] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 192431#[L21-3]don't care [408] L21-3-->L21-4: Formula: (and (= (select |v_#valid_20| 2) 1) (= (select |v_#length_11| 2) 25)) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 192433#[L21-4]don't care [378] L21-4-->L42: Formula: (and (= v_~A~0.base_10 0) (= v_~A~0.offset_10 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_10, ~A~0.offset=v_~A~0.offset_10} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 198973#[L42]don't care [365] L42-->L42-1: Formula: (= v_~min~0_7 0) InVars {} OutVars{~min~0=v_~min~0_7} AuxVars[] AssignedVars[~min~0] 198975#[L42-1]don't care [451] L42-1-->L42-2: Formula: (= v_~max~0_7 0) InVars {} OutVars{~max~0=v_~max~0_7} AuxVars[] AssignedVars[~max~0] 208223#[L42-2]don't care [375] L42-2-->L43: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0] 198321#[L43]don't care [457] L43-->L43-1: Formula: (= v_~v_assert~0_2 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[~v_assert~0] 188689#[L43-1]don't care [341] L43-1-->L43-2: Formula: (= v_~b1~0_3 0) InVars {} OutVars{~b1~0=v_~b1~0_3} AuxVars[] AssignedVars[~b1~0] 188691#[L43-2]don't care [364] L43-2-->L-1-3: Formula: (= v_~b2~0_3 0) InVars {} OutVars{~b2~0=v_~b2~0_3} AuxVars[] AssignedVars[~b2~0] 206527#[L-1-3]don't care [466] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 206529#[L-1-4]don't care [354] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 181231#[L-1-5]don't care [319] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 173065#[L-1-6]don't care [439] L-1-6-->L103: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_1|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_1|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_1|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_1|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_1|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 173067#[L103]don't care [452] L103-->L103-1: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_12|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_13|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 203417#[L103-1]don't care [349] L103-1-->L103-2: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_14|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, #valid=|v_#valid_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 203419#[L103-2]don't care [421] L103-2-->L103-3: Formula: (and (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_4|) (= (store |v_#length_17| |v_ULTIMATE.start_main_~#t3~0#1.base_4| 4) |v_#length_16|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_4| 0)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t3~0#1.base_4|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_4| 0) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t3~0#1.base_4| 1) |v_#valid_25|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_17|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_4|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 194195#[L103-3]don't care [396] L103-3-->L103-4: Formula: (and (= |v_ULTIMATE.start_main_~#t4~0#1.offset_4| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t4~0#1.base_4| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_4| 0)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t4~0#1.base_4|) 0) (= (store |v_#length_19| |v_ULTIMATE.start_main_~#t4~0#1.base_4| 4) |v_#length_18|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_19|, #valid=|v_#valid_28|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_4|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_4|, #valid=|v_#valid_27|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 194197#[L103-4]don't care [344] L103-4-->L105: Formula: (= |v_ULTIMATE.start_main_#t~nondet15#1_2| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0] 202339#[L105]don't care [323] L105-->L106: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1] 202891#[L106]don't care [450] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 202893#[L106-1]don't care [440] L106-1-->L106-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~N~0_9) 1 0)) InVars {~N~0=v_~N~0_9} OutVars{~N~0=v_~N~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 187219#[L106-2]don't care [361] L106-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 187221#[L37]don't care [366] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 190231#[L38]don't care [380] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 199271#[L37-1]don't care [367] L37-1-->L107: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 199273#[L107]don't care [461] L107-->L107-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 204051#[L107-1]don't care [455] L107-1-->L107-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_10) InVars {~N~0=v_~N~0_10} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 203875#[L107-2]don't care [383] L107-2-->L107-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 171937#[L107-3]don't care [381] L107-3-->L125: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1] 171939#[L125]don't care [410] L125-->L126: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 207675#[L126]don't care [389] L126-->L126-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 207471#[L126-1]don't care [360] L126-1-->L126-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 180543#[L126-2]don't care [467] L126-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 180545#[L37-2]don't care [324] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 183637#[L38-3]don't care [343] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 202183#[L37-3]don't care [338] L37-3-->L127: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 202185#[L127]don't care [458] L127-->L127-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 174353#[L127-1]don't care [413] L127-1-->L127-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 174355#[L127-2]don't care [373] L127-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 208269#[L37-4]don't care [438] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 200847#[L38-6]don't care [420] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 200849#[L37-5]don't care [404] L37-5-->L129: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 179313#[L129]don't care [443] L129-->L129-1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_2| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| 0)) (= (store |v_#length_21| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_20|) (= (store |v_#valid_30| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| 1) |v_#valid_29|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| |v_#StackHeapBarrier_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2|, #valid=|v_#valid_29|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, #valid, #length] 179315#[L129-1]don't care [350] L129-1-->L129-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 196609#[L129-2]don't care [313] L129-2-->L130: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base] 196611#[L130]don't care [368] L130-->L130-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 203357#[L130-6]don't care [447] L130-6-->L130-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 203359#[L130-7]don't care [435] L130-7-->L133: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 208221#[L133]don't care [436] L133-->L107-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret16#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~ret16#1.offset] 176223#[L107-4]don't care [397] L107-4-->L107-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 176225#[L107-5]don't care [395] L107-5-->L107-6: Formula: (and (= v_~A~0.offset_11 |v_ULTIMATE.start_main_#t~ret16#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret16#1.base_3| v_~A~0.base_11)) InVars {ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_3|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_3|} OutVars{~A~0.base=v_~A~0.base_11, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_3|, ~A~0.offset=v_~A~0.offset_11, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 201413#[L107-6]don't care [429] L107-6-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_4|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~ret16#1.offset] 194171#[L110]don't care [388] L110-->L110-1: Formula: (= |v_ULTIMATE.start_main_#t~pre17#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre17#1] 194173#[L110-1]don't care [325] L110-1-->L110-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 196039#[L110-2]don't care [348] L110-2-->L110-3: Formula: (and (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre17#1_3|))) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_23| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 193857#[L110-3]don't care [508] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_4|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_4|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~ite5] 193859#[L110-4, thread1ENTRY]don't care [469] thread1ENTRY-->L50: Formula: (and (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) (<= (+ v_~A~0.offset_20 4) (select |v_#length_39| v_~A~0.base_20)) (<= 0 v_~A~0.offset_20) (= (select |v_#valid_48| v_~A~0.base_20) 1)) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, #length=|v_#length_39|, ~A~0.offset=v_~A~0.offset_20, #valid=|v_#valid_48|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_37|, #length=|v_#length_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, ~min~0] 208237#[L110-4, L50]don't care [470] L50-->L54: Formula: (= v_~b1~0_1 1) InVars {} OutVars{~b1~0=v_~b1~0_1} AuxVars[] AssignedVars[~b1~0] 196683#[L54, L110-4]don't care [471] L54-->L56-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 189075#[L56-4, L110-4]don't care [2022-07-22 11:57:15,590 INFO L750 eck$LassoCheckResult]: Loop: 189075#[L56-4, L110-4]don't care [474] L56-4-->L57: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_2) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 189079#[L110-4, L57]don't care [476] L57-->L59: Formula: (let ((.cse6 (* v_thread1Thread1of1ForFork0_~i~0_7 4))) (let ((.cse5 (+ .cse6 v_~A~0.offset_46))) (let ((.cse0 (<= (+ .cse6 v_~A~0.offset_46 4) (select |v_#length_65| v_~A~0.base_46))) (.cse1 (<= 0 .cse5)) (.cse4 (= (select |v_#valid_74| v_~A~0.base_46) 1))) (and .cse0 .cse1 (let ((.cse3 (select (select |v_#memory_int_71| v_~A~0.base_46) .cse5))) (let ((.cse2 (< v_~min~0_29 .cse3))) (or (and .cse2 (= |v_thread1Thread1of1ForFork0_#t~mem4_1| |v_thread1_#t~mem4_24|) (= v_~min~0_29 v_~min~0_28)) (and .cse0 (= v_~min~0_28 |v_thread1_#t~mem4_24|) (not .cse2) (= .cse3 |v_thread1_#t~mem4_24|) .cse1 .cse4)))) .cse4)))) InVars {~A~0.base=v_~A~0.base_46, ~A~0.offset=v_~A~0.offset_46, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_1|, ~min~0=v_~min~0_29, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_71|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_65|} OutVars{~A~0.base=v_~A~0.base_46, ~A~0.offset=v_~A~0.offset_46, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_1|, ~min~0=v_~min~0_28, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_71|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_65|, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_1|} AuxVars[|v_thread1_#t~mem4_24|] AssignedVars[thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, ~min~0, thread1Thread1of1ForFork0_#t~ite5] 175985#[L59, L110-4]don't care [478] L59-->L56-2: Formula: (= v_thread1Thread1of1ForFork0_~i~0_9 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2] 175989#[L56-2, L110-4]don't care [479] L56-2-->L56-3: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 206973#[L110-4, L56-3]don't care [480] L56-3-->L56-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2] 189075#[L56-4, L110-4]don't care [2022-07-22 11:57:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 36295502, now seen corresponding path program 1 times [2022-07-22 11:57:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:15,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459939340] [2022-07-22 11:57:15,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:15,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:15,889 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-22 11:57:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:57:15,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459939340] [2022-07-22 11:57:15,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459939340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:57:15,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:57:15,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 11:57:15,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019693878] [2022-07-22 11:57:15,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:57:15,894 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 11:57:15,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash 481033308, now seen corresponding path program 1 times [2022-07-22 11:57:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:15,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015906782] [2022-07-22 11:57:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:15,903 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:15,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:57:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:57:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:57:16,028 INFO L87 Difference]: Start difference. First operand 25376 states and 115310 transitions. cyclomatic complexity: 92385 Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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-22 11:57:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:57:16,926 INFO L93 Difference]: Finished difference Result 25533 states and 108895 transitions. [2022-07-22 11:57:16,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25533 states and 108895 transitions. [2022-07-22 11:57:17,512 INFO L131 ngComponentsAnalysis]: Automaton has 2450 accepting balls. 22290 [2022-07-22 11:57:18,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25533 states to 25380 states and 108583 transitions. [2022-07-22 11:57:18,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25370 [2022-07-22 11:57:18,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25370 [2022-07-22 11:57:18,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25380 states and 108583 transitions. [2022-07-22 11:57:18,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:57:18,420 INFO L220 hiAutomatonCegarLoop]: Abstraction has 25380 states and 108583 transitions. [2022-07-22 11:57:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25380 states and 108583 transitions. [2022-07-22 11:57:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 25376. [2022-07-22 11:57:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25376 states, 25376 states have (on average 4.278806746532156) internal successors, (108579), 25375 states have internal predecessors, (108579), 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-22 11:57:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25376 states to 25376 states and 108579 transitions. [2022-07-22 11:57:20,265 INFO L242 hiAutomatonCegarLoop]: Abstraction has 25376 states and 108579 transitions. [2022-07-22 11:57:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 11:57:20,273 INFO L425 stractBuchiCegarLoop]: Abstraction has 25376 states and 108579 transitions. [2022-07-22 11:57:20,273 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 11:57:20,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25376 states and 108579 transitions. [2022-07-22 11:57:20,624 INFO L131 ngComponentsAnalysis]: Automaton has 2450 accepting balls. 22290 [2022-07-22 11:57:20,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:20,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:20,626 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:57:20,626 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:57:20,628 INFO L748 eck$LassoCheckResult]: Stem: 284314#[ULTIMATE.startENTRY]don't care [453] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 283916#[L-1]don't care [345] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 237736#[L-1-1]don't care [463] L-1-1-->L-1-2: Formula: (= (select |v_#valid_18| 0) 0) InVars {#valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|} AuxVars[] AssignedVars[] 237738#[L-1-2]don't care [465] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 246866#[L21]don't care [424] L21-->L21-1: Formula: (and (= (select |v_#valid_19| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_19|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[] 246868#[L21-1]don't care [449] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 283974#[L21-2]don't care [357] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 268740#[L21-3]don't care [408] L21-3-->L21-4: Formula: (and (= (select |v_#valid_20| 2) 1) (= (select |v_#length_11| 2) 25)) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 268742#[L21-4]don't care [378] L21-4-->L42: Formula: (and (= v_~A~0.base_10 0) (= v_~A~0.offset_10 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_10, ~A~0.offset=v_~A~0.offset_10} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 275282#[L42]don't care [365] L42-->L42-1: Formula: (= v_~min~0_7 0) InVars {} OutVars{~min~0=v_~min~0_7} AuxVars[] AssignedVars[~min~0] 275284#[L42-1]don't care [451] L42-1-->L42-2: Formula: (= v_~max~0_7 0) InVars {} OutVars{~max~0=v_~max~0_7} AuxVars[] AssignedVars[~max~0] 284532#[L42-2]don't care [375] L42-2-->L43: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0] 274630#[L43]don't care [457] L43-->L43-1: Formula: (= v_~v_assert~0_2 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[~v_assert~0] 265002#[L43-1]don't care [341] L43-1-->L43-2: Formula: (= v_~b1~0_3 0) InVars {} OutVars{~b1~0=v_~b1~0_3} AuxVars[] AssignedVars[~b1~0] 265004#[L43-2]don't care [364] L43-2-->L-1-3: Formula: (= v_~b2~0_3 0) InVars {} OutVars{~b2~0=v_~b2~0_3} AuxVars[] AssignedVars[~b2~0] 282836#[L-1-3]don't care [466] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 282838#[L-1-4]don't care [354] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 257540#[L-1-5]don't care [319] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 249364#[L-1-6]don't care [439] L-1-6-->L103: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_1|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_1|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_1|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_1|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_1|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 249366#[L103]don't care [452] L103-->L103-1: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_12|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_13|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 279726#[L103-1]don't care [349] L103-1-->L103-2: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_14|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, #valid=|v_#valid_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 279728#[L103-2]don't care [421] L103-2-->L103-3: Formula: (and (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_4|) (= (store |v_#length_17| |v_ULTIMATE.start_main_~#t3~0#1.base_4| 4) |v_#length_16|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_4| 0)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t3~0#1.base_4|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_4| 0) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t3~0#1.base_4| 1) |v_#valid_25|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_17|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_4|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 270504#[L103-3]don't care [396] L103-3-->L103-4: Formula: (and (= |v_ULTIMATE.start_main_~#t4~0#1.offset_4| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t4~0#1.base_4| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_4| 0)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t4~0#1.base_4|) 0) (= (store |v_#length_19| |v_ULTIMATE.start_main_~#t4~0#1.base_4| 4) |v_#length_18|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_19|, #valid=|v_#valid_28|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_4|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_4|, #valid=|v_#valid_27|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 270506#[L103-4]don't care [344] L103-4-->L105: Formula: (= |v_ULTIMATE.start_main_#t~nondet15#1_2| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0] 278648#[L105]don't care [323] L105-->L106: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1] 279200#[L106]don't care [450] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 279202#[L106-1]don't care [440] L106-1-->L106-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~N~0_9) 1 0)) InVars {~N~0=v_~N~0_9} OutVars{~N~0=v_~N~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 263528#[L106-2]don't care [361] L106-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 263530#[L37]don't care [366] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 266540#[L38]don't care [380] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 275580#[L37-1]don't care [367] L37-1-->L107: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 275582#[L107]don't care [461] L107-->L107-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 280360#[L107-1]don't care [455] L107-1-->L107-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_10) InVars {~N~0=v_~N~0_10} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 280184#[L107-2]don't care [383] L107-2-->L107-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 248246#[L107-3]don't care [381] L107-3-->L125: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1] 248248#[L125]don't care [410] L125-->L126: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 283984#[L126]don't care [389] L126-->L126-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 283780#[L126-1]don't care [360] L126-1-->L126-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 256844#[L126-2]don't care [467] L126-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 256846#[L37-2]don't care [324] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 259946#[L38-3]don't care [343] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 278492#[L37-3]don't care [338] L37-3-->L127: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 278494#[L127]don't care [458] L127-->L127-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 250662#[L127-1]don't care [413] L127-1-->L127-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 250664#[L127-2]don't care [373] L127-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 284578#[L37-4]don't care [438] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 277156#[L38-6]don't care [420] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 277158#[L37-5]don't care [404] L37-5-->L129: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 255628#[L129]don't care [443] L129-->L129-1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_2| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| 0)) (= (store |v_#length_21| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_20|) (= (store |v_#valid_30| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| 1) |v_#valid_29|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2| |v_#StackHeapBarrier_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_2|, #valid=|v_#valid_29|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, #valid, #length] 255630#[L129-1]don't care [350] L129-1-->L129-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 272924#[L129-2]don't care [313] L129-2-->L130: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base] 272926#[L130]don't care [368] L130-->L130-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 279666#[L130-6]don't care [448] L130-6-->L131: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 253666#[L131]don't care [352] L131-->L131-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (select |v_#valid_31| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= (store |v_#memory_int_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_2|)) |v_#memory_int_13|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int] 253668#[L131-1]don't care [422] L131-1-->L130-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet31#1] 272146#[L130-3]don't care [312] L130-3-->L130-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1] 283202#[L130-4]don't care [340] L130-4-->L130-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 279368#[L130-5]don't care [445] L130-5-->L130-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1] 279370#[L130-6]don't care [447] L130-6-->L130-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 279668#[L130-7]don't care [435] L130-7-->L133: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 284530#[L133]don't care [436] L133-->L107-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret16#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~ret16#1.offset] 252532#[L107-4]don't care [397] L107-4-->L107-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 252534#[L107-5]don't care [395] L107-5-->L107-6: Formula: (and (= v_~A~0.offset_11 |v_ULTIMATE.start_main_#t~ret16#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret16#1.base_3| v_~A~0.base_11)) InVars {ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_3|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_3|} OutVars{~A~0.base=v_~A~0.base_11, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_3|, ~A~0.offset=v_~A~0.offset_11, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 277722#[L107-6]don't care [429] L107-6-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_4|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~ret16#1.offset] 270484#[L110]don't care [388] L110-->L110-1: Formula: (= |v_ULTIMATE.start_main_#t~pre17#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre17#1] 270486#[L110-1]don't care [325] L110-1-->L110-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 272348#[L110-2]don't care [348] L110-2-->L110-3: Formula: (and (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre17#1_3|))) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_23| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 270166#[L110-3]don't care [508] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_4|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_4|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~ite5] 270168#[L110-4, thread1ENTRY]don't care [469] thread1ENTRY-->L50: Formula: (and (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) (<= (+ v_~A~0.offset_20 4) (select |v_#length_39| v_~A~0.base_20)) (<= 0 v_~A~0.offset_20) (= (select |v_#valid_48| v_~A~0.base_20) 1)) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, #length=|v_#length_39|, ~A~0.offset=v_~A~0.offset_20, #valid=|v_#valid_48|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_37|, #length=|v_#length_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, ~min~0] 284546#[L110-4, L50]don't care [470] L50-->L54: Formula: (= v_~b1~0_1 1) InVars {} OutVars{~b1~0=v_~b1~0_1} AuxVars[] AssignedVars[~b1~0] 272992#[L54, L110-4]don't care [471] L54-->L56-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 265384#[L56-4, L110-4]don't care [2022-07-22 11:57:20,628 INFO L750 eck$LassoCheckResult]: Loop: 265384#[L56-4, L110-4]don't care [474] L56-4-->L57: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_2) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 265388#[L110-4, L57]don't care [476] L57-->L59: Formula: (let ((.cse6 (* v_thread1Thread1of1ForFork0_~i~0_7 4))) (let ((.cse5 (+ .cse6 v_~A~0.offset_46))) (let ((.cse0 (<= (+ .cse6 v_~A~0.offset_46 4) (select |v_#length_65| v_~A~0.base_46))) (.cse1 (<= 0 .cse5)) (.cse4 (= (select |v_#valid_74| v_~A~0.base_46) 1))) (and .cse0 .cse1 (let ((.cse3 (select (select |v_#memory_int_71| v_~A~0.base_46) .cse5))) (let ((.cse2 (< v_~min~0_29 .cse3))) (or (and .cse2 (= |v_thread1Thread1of1ForFork0_#t~mem4_1| |v_thread1_#t~mem4_24|) (= v_~min~0_29 v_~min~0_28)) (and .cse0 (= v_~min~0_28 |v_thread1_#t~mem4_24|) (not .cse2) (= .cse3 |v_thread1_#t~mem4_24|) .cse1 .cse4)))) .cse4)))) InVars {~A~0.base=v_~A~0.base_46, ~A~0.offset=v_~A~0.offset_46, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_1|, ~min~0=v_~min~0_29, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_71|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_65|} OutVars{~A~0.base=v_~A~0.base_46, ~A~0.offset=v_~A~0.offset_46, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_1|, ~min~0=v_~min~0_28, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_71|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_65|, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_1|} AuxVars[|v_thread1_#t~mem4_24|] AssignedVars[thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, ~min~0, thread1Thread1of1ForFork0_#t~ite5] 252286#[L59, L110-4]don't care [478] L59-->L56-2: Formula: (= v_thread1Thread1of1ForFork0_~i~0_9 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2] 252290#[L56-2, L110-4]don't care [479] L56-2-->L56-3: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 283282#[L110-4, L56-3]don't care [480] L56-3-->L56-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2] 265384#[L56-4, L110-4]don't care [2022-07-22 11:57:20,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:20,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1774182701, now seen corresponding path program 1 times [2022-07-22 11:57:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:20,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711790931] [2022-07-22 11:57:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:20,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:20,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:20,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:20,725 INFO L85 PathProgramCache]: Analyzing trace with hash 481033308, now seen corresponding path program 2 times [2022-07-22 11:57:20,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:20,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366464764] [2022-07-22 11:57:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:20,733 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:20,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 103305418, now seen corresponding path program 1 times [2022-07-22 11:57:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:20,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21461386] [2022-07-22 11:57:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:20,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:20,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:20,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:24,279 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:24,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:24,280 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:24,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:24,280 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:57:24,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:24,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:24,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:24,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-min-max-inc.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 11:57:24,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:24,281 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:24,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:24,816 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 11:57:24,820 INFO L158 Benchmark]: Toolchain (without parser) took 31459.81ms. Allocated memory was 152.0MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 126.7MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-07-22 11:57:24,821 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 152.0MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 11:57:24,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.17ms. Allocated memory is still 152.0MB. Free memory was 126.3MB in the beginning and 115.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 11:57:24,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.88ms. Allocated memory is still 152.0MB. Free memory was 115.0MB in the beginning and 113.1MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 11:57:24,822 INFO L158 Benchmark]: Boogie Preprocessor took 38.67ms. Allocated memory is still 152.0MB. Free memory was 113.1MB in the beginning and 111.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 11:57:24,823 INFO L158 Benchmark]: RCFGBuilder took 1006.70ms. Allocated memory is still 152.0MB. Free memory was 111.4MB in the beginning and 125.9MB in the end (delta: -14.5MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2022-07-22 11:57:24,824 INFO L158 Benchmark]: BuchiAutomizer took 30035.88ms. Allocated memory was 152.0MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 125.4MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-07-22 11:57:24,827 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.27ms. Allocated memory is still 152.0MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 317.17ms. Allocated memory is still 152.0MB. Free memory was 126.3MB in the beginning and 115.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.88ms. Allocated memory is still 152.0MB. Free memory was 115.0MB in the beginning and 113.1MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.67ms. Allocated memory is still 152.0MB. Free memory was 113.1MB in the beginning and 111.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1006.70ms. Allocated memory is still 152.0MB. Free memory was 111.4MB in the beginning and 125.9MB in the end (delta: -14.5MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 30035.88ms. Allocated memory was 152.0MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 125.4MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 11:57:24,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...