/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:46:22,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:46:22,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:46:22,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:46:22,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:46:22,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:46:22,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:46:22,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:46:22,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:46:22,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:46:22,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:46:22,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:46:22,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:46:22,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:46:22,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:46:22,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:46:22,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:46:22,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:46:22,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:46:22,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:46:22,854 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:46:22,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:46:22,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:46:22,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:46:22,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:46:22,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:46:22,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:46:22,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:46:22,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:46:22,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:46:22,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:46:22,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:46:22,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:46:22,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:46:22,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:46:22,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:46:22,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:46:22,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:46:22,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:46:22,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:46:22,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:46:22,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:46:22,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:46:22,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:46:22,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:46:22,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:46:22,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:46:22,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:46:22,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:46:22,923 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:46:22,923 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:46:22,923 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:46:22,923 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:46:22,924 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:46:22,924 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:46:22,924 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:46:22,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:46:22,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:46:22,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:46:22,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:46:22,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:46:22,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:46:22,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:46:22,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:46:22,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:46:22,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:46:22,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:46:22,926 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:46:22,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:46:22,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:46:22,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:46:22,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:46:22,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:46:22,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:46:22,927 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:46:22,929 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:46:22,929 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 12:46:23,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:46:23,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:46:23,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:46:23,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:46:23,315 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:46:23,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-07-22 12:46:23,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96cb9b8f/7306c2643ab843f5bfb45caeee948e36/FLAG5bd923714 [2022-07-22 12:46:24,044 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:46:24,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-07-22 12:46:24,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96cb9b8f/7306c2643ab843f5bfb45caeee948e36/FLAG5bd923714 [2022-07-22 12:46:24,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96cb9b8f/7306c2643ab843f5bfb45caeee948e36 [2022-07-22 12:46:24,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:46:24,421 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:46:24,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:46:24,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:46:24,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:46:24,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9a937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24, skipping insertion in model container [2022-07-22 12:46:24,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:46:24,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:46:24,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-07-22 12:46:24,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:46:24,659 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:46:24,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-07-22 12:46:24,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:46:24,726 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:46:24,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24 WrapperNode [2022-07-22 12:46:24,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:46:24,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:46:24,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:46:24,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:46:24,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,778 INFO L137 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2022-07-22 12:46:24,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:46:24,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:46:24,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:46:24,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:46:24,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:46:24,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:46:24,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:46:24,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:46:24,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 12:46:24,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:24,879 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 12:46:24,902 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 12:46:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:46:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:46:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:46:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:46:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:46:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:46:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:46:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:46:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:46:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:46:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:46:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:46:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:46:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:46:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:46:24,945 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 12:46:25,037 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:46:25,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:46:25,358 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:46:25,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:46:25,556 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:46:25,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:25 BoogieIcfgContainer [2022-07-22 12:46:25,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:46:25,560 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:46:25,560 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:46:25,564 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:46:25,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:46:25,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:46:24" (1/3) ... [2022-07-22 12:46:25,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@314f0975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:46:25, skipping insertion in model container [2022-07-22 12:46:25,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:46:25,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (2/3) ... [2022-07-22 12:46:25,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@314f0975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:46:25, skipping insertion in model container [2022-07-22 12:46:25,568 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:46:25,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:25" (3/3) ... [2022-07-22 12:46:25,569 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-07-22 12:46:25,722 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:46:25,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 118 transitions, 252 flow [2022-07-22 12:46:25,886 INFO L129 PetriNetUnfolder]: 9/114 cut-off events. [2022-07-22 12:46:25,886 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:46:25,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 9/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-22 12:46:25,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 118 transitions, 252 flow [2022-07-22 12:46:25,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 114 transitions, 240 flow [2022-07-22 12:46:25,909 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:46:25,924 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 114 transitions, 240 flow [2022-07-22 12:46:25,928 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 114 transitions, 240 flow [2022-07-22 12:46:25,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 114 transitions, 240 flow [2022-07-22 12:46:25,977 INFO L129 PetriNetUnfolder]: 9/114 cut-off events. [2022-07-22 12:46:25,978 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:46:25,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 9/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-22 12:46:25,981 INFO L116 LiptonReduction]: Number of co-enabled transitions 572 [2022-07-22 12:46:29,999 INFO L131 LiptonReduction]: Checked pairs total: 874 [2022-07-22 12:46:29,999 INFO L133 LiptonReduction]: Total number of compositions: 113 [2022-07-22 12:46:30,020 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:46:30,021 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:46:30,021 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:46:30,021 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:46:30,021 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:46:30,021 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:46:30,021 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:46:30,022 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:46:30,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:46:30,067 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 33 [2022-07-22 12:46:30,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:46:30,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:46:30,073 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:46:30,073 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:46:30,073 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:46:30,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 52 states, but on-demand construction may add more states [2022-07-22 12:46:30,080 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 33 [2022-07-22 12:46:30,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:46:30,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:46:30,081 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:46:30,081 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:46:30,086 INFO L748 eck$LassoCheckResult]: Stem: 117#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 120#[L97-6]don't care [2022-07-22 12:46:30,087 INFO L750 eck$LassoCheckResult]: Loop: 120#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (= |v_#memory_int_81| (store |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (select |v_#valid_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_82|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_81|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 120#[L97-6]don't care [2022-07-22 12:46:30,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:30,093 INFO L85 PathProgramCache]: Analyzing trace with hash 573, now seen corresponding path program 1 times [2022-07-22 12:46:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:30,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224955272] [2022-07-22 12:46:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:30,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:30,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash 558, now seen corresponding path program 1 times [2022-07-22 12:46:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:30,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379103300] [2022-07-22 12:46:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:30,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:30,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:30,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:30,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash 18290, now seen corresponding path program 1 times [2022-07-22 12:46:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:30,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829265496] [2022-07-22 12:46:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:30,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:30,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:31,121 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:46:31,121 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:46:31,122 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:46:31,122 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:46:31,122 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:46:31,122 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:31,122 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:46:31,122 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:46:31,123 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:46:31,123 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:46:31,123 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:46:31,146 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 12:46:31,152 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 12:46:31,154 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 12:46:31,157 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 12:46:31,159 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 12:46:31,162 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 12:46:31,164 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 12:46:31,165 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 12:46:31,170 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 12:46:31,172 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 12:46:31,174 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 12:46:31,176 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 12:46:31,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 12:46:31,519 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 12:46:31,522 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 12:46:31,525 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 12:46:31,528 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 12:46:31,529 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 12:46:31,531 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 12:46:31,533 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 12:46:31,535 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 12:46:31,539 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 12:46:31,541 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 12:46:31,542 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 12:46:31,544 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 12:46:31,546 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 12:46:31,548 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 12:46:31,549 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 12:46:31,951 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:46:31,956 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:46:31,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:31,963 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 12:46:31,970 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 12:46:31,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:31,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:31,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:31,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:31,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:31,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:31,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:31,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:31,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:32,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,035 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 12:46:32,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,057 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 12:46:32,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,099 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 12:46:32,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,101 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 12:46:32,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,108 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 12:46:32,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,159 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 12:46:32,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,161 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 12:46:32,164 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 12:46:32,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,231 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 12:46:32,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,233 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 12:46:32,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:32,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:32,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:32,250 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 12:46:32,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,287 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 12:46:32,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,288 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 12:46:32,290 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 12:46:32,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:32,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:32,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:32,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:32,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,341 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 12:46:32,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,343 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 12:46:32,343 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 12:46:32,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:32,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:32,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:32,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,379 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 12:46:32,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,381 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 12:46:32,381 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 12:46:32,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,449 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 12:46:32,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,450 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 12:46:32,456 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 12:46:32,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:32,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:32,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:32,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:32,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,491 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 12:46:32,493 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 12:46:32,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,568 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 12:46:32,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,570 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 12:46:32,572 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 12:46:32,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:32,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:32,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:32,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 12:46:32,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,637 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 12:46:32,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 12:46:32,646 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 12:46:32,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,713 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 12:46:32,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,715 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 12:46:32,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,722 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 12:46:32,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,780 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 12:46:32,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,782 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 12:46:32,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:32,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,803 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 12:46:32,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:32,847 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 12:46:32,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,848 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 12:46:32,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 12:46:32,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:32,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:32,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:32,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:32,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:32,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:32,882 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 12:46:32,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:46:32,918 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 12:46:32,919 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:46:32,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:32,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:32,923 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 12:46:32,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:46:32,936 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 12:46:32,960 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:46:32,960 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:46:32,961 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:46:33,000 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 12:46:33,059 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:46:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:33,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:46:33,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:46:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:33,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:46:33,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:46:33,147 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 12:46:33,216 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:46:33,219 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 52 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:33,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 52 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 120 transitions. Complement of second has 3 states. [2022-07-22 12:46:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:46:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:46:33,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:46:33,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:33,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:46:33,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:33,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:46:33,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:33,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 120 transitions. [2022-07-22 12:46:33,281 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2022-07-22 12:46:33,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 48 states and 109 transitions. [2022-07-22 12:46:33,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-22 12:46:33,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-07-22 12:46:33,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 109 transitions. [2022-07-22 12:46:33,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:46:33,293 INFO L220 hiAutomatonCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-22 12:46:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 109 transitions. [2022-07-22 12:46:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-22 12:46:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 47 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 109 transitions. [2022-07-22 12:46:33,327 INFO L242 hiAutomatonCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-22 12:46:33,327 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-22 12:46:33,327 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:46:33,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 109 transitions. [2022-07-22 12:46:33,330 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2022-07-22 12:46:33,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:46:33,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:46:33,331 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:46:33,331 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:46:33,332 INFO L748 eck$LassoCheckResult]: Stem: 438#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 368#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 370#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 432#[thread1ENTRY, L81-4]don't care [400] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 422#[L49-4, L81-4]don't care [2022-07-22 12:46:33,332 INFO L750 eck$LassoCheckResult]: Loop: 422#[L49-4, L81-4]don't care [430] L49-4-->L52: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_15| 4))) (let ((.cse0 (+ .cse2 v_~A~0.offset_27)) (.cse1 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|))) (and (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0))) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| v_~counter~0_29) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| |v_thread1Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| .cse1) (<= (+ .cse2 v_~A~0.offset_27 4) (select |v_#length_38| v_~A~0.base_27)) (= (select |v_#valid_43| v_~A~0.base_27) 1) (= (select (select |v_#memory_int_35| v_~A~0.base_27) .cse0) |v_thread1Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_~tmp~0#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (< |v_thread1Thread1of1ForFork0_~i~0#1_15| v_~N~0_8)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~N~0=v_~N~0_8} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_7|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] 426#[L81-4, L52]don't care [519] L52-->L49-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_29| (+ |v_thread1Thread1of1ForFork0_~i~0#1_30| 1)) (= |v_thread1Thread1of1ForFork0_~tmp~0#1_11| v_~counter~0_45)) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_30|} OutVars{~counter~0=v_~counter~0_45, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1] 422#[L49-4, L81-4]don't care [2022-07-22 12:46:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 17594078, now seen corresponding path program 1 times [2022-07-22 12:46:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:33,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707848659] [2022-07-22 12:46:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:33,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:33,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash 14810, now seen corresponding path program 1 times [2022-07-22 12:46:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:33,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510146207] [2022-07-22 12:46:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:33,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:33,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:33,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash -271946377, now seen corresponding path program 1 times [2022-07-22 12:46:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:33,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57823266] [2022-07-22 12:46:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:33,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:33,590 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 12:46:33,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:46:33,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57823266] [2022-07-22 12:46:33,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57823266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:46:33,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:46:33,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:46:33,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531113026] [2022-07-22 12:46:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:46:33,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:46:33,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:46:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:46:33,750 INFO L87 Difference]: Start difference. First operand 48 states and 109 transitions. cyclomatic complexity: 76 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:33,874 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 12:46:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:46:33,902 INFO L93 Difference]: Finished difference Result 83 states and 179 transitions. [2022-07-22 12:46:33,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 179 transitions. [2022-07-22 12:46:33,906 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 48 [2022-07-22 12:46:33,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 79 states and 171 transitions. [2022-07-22 12:46:33,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-22 12:46:33,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 12:46:33,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 171 transitions. [2022-07-22 12:46:33,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:46:33,910 INFO L220 hiAutomatonCegarLoop]: Abstraction has 79 states and 171 transitions. [2022-07-22 12:46:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 171 transitions. [2022-07-22 12:46:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2022-07-22 12:46:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.276923076923077) internal successors, (148), 64 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 148 transitions. [2022-07-22 12:46:33,919 INFO L242 hiAutomatonCegarLoop]: Abstraction has 65 states and 148 transitions. [2022-07-22 12:46:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:46:33,921 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 148 transitions. [2022-07-22 12:46:33,921 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:46:33,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 148 transitions. [2022-07-22 12:46:33,923 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 40 [2022-07-22 12:46:33,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:46:33,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:46:33,924 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:46:33,924 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:46:33,924 INFO L748 eck$LassoCheckResult]: Stem: 639#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 561#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (= |v_#memory_int_81| (store |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (select |v_#valid_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_82|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_81|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 565#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 567#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 677#[thread1ENTRY, L81-4]don't care [400] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 663#[L49-4, L81-4]don't care [2022-07-22 12:46:33,925 INFO L750 eck$LassoCheckResult]: Loop: 663#[L49-4, L81-4]don't care [430] L49-4-->L52: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_15| 4))) (let ((.cse0 (+ .cse2 v_~A~0.offset_27)) (.cse1 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|))) (and (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0))) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| v_~counter~0_29) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| |v_thread1Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| .cse1) (<= (+ .cse2 v_~A~0.offset_27 4) (select |v_#length_38| v_~A~0.base_27)) (= (select |v_#valid_43| v_~A~0.base_27) 1) (= (select (select |v_#memory_int_35| v_~A~0.base_27) .cse0) |v_thread1Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_~tmp~0#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (< |v_thread1Thread1of1ForFork0_~i~0#1_15| v_~N~0_8)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~N~0=v_~N~0_8} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_7|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] 661#[L81-4, L52]don't care [519] L52-->L49-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_29| (+ |v_thread1Thread1of1ForFork0_~i~0#1_30| 1)) (= |v_thread1Thread1of1ForFork0_~tmp~0#1_11| v_~counter~0_45)) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_30|} OutVars{~counter~0=v_~counter~0_45, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1] 663#[L49-4, L81-4]don't care [2022-07-22 12:46:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash 545401225, now seen corresponding path program 1 times [2022-07-22 12:46:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:33,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075069568] [2022-07-22 12:46:33,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:33,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:33,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash 14810, now seen corresponding path program 2 times [2022-07-22 12:46:33,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:33,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4910543] [2022-07-22 12:46:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:33,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:34,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:34,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash 144580962, now seen corresponding path program 1 times [2022-07-22 12:46:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:34,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485812083] [2022-07-22 12:46:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:34,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:34,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:35,189 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:46:35,189 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:46:35,190 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:46:35,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:46:35,190 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:46:35,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:35,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:46:35,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:46:35,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:46:35,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:46:35,191 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:46:35,206 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 12:46:35,210 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 12:46:35,971 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 12:46:35,974 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 12:46:35,975 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 12:46:35,977 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 12:46:35,980 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 12:46:35,982 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 12:46:35,984 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 12:46:35,988 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 12:46:35,990 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 12:46:35,991 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 12:46:35,993 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 12:46:35,996 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 12:46:35,997 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 12:46:35,999 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 12:46:36,001 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 12:46:36,002 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 12:46:36,004 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 12:46:36,005 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 12:46:36,007 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 12:46:36,008 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 12:46:36,012 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 12:46:36,014 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 12:46:36,016 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 12:46:36,018 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 12:46:36,020 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 12:46:36,022 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 12:46:36,023 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 12:46:36,736 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:46:36,736 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:46:36,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:36,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:36,737 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 12:46:36,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:36,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:36,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:36,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:36,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:36,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:36,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:36,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:36,754 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 12:46:36,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:36,798 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 12:46:36,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:36,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:36,799 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 12:46:36,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:36,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:36,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:36,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:36,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:36,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:36,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:36,818 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 12:46:36,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:36,856 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 12:46:36,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:36,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:36,857 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 12:46:36,860 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 12:46:36,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:36,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:36,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:36,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:36,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:36,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:36,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:36,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:36,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:36,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:36,915 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 12:46:36,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:36,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:36,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:36,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:36,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:36,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:36,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:36,931 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 12:46:36,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:36,976 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 12:46:36,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:36,978 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 12:46:36,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:36,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:36,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:36,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:36,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:36,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:36,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:36,999 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 12:46:37,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:37,042 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 12:46:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:37,043 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 12:46:37,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:37,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:37,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:37,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:37,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:37,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:37,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:37,060 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 12:46:37,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:37,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:37,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:37,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:37,104 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 12:46:37,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:37,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:37,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:37,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:37,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:37,120 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 12:46:37,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:37,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:37,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:37,168 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 12:46:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:37,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:37,170 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 12:46:37,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:37,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:37,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:37,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:37,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:37,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:37,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:37,188 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 12:46:37,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:37,225 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 12:46:37,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:37,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:37,227 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 12:46:37,228 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 12:46:37,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:37,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:37,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:37,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:37,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:37,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:37,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:37,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:46:37,324 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2022-07-22 12:46:37,325 INFO L444 ModelExtractionUtils]: 12 out of 37 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-07-22 12:46:37,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:37,326 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 12:46:37,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:46:37,341 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 12:46:37,353 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:46:37,353 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:46:37,353 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_~i~0#1, ~N~0) = -1*thread1Thread1of1ForFork0_~i~0#1 + 1*~N~0 Supporting invariants [] [2022-07-22 12:46:37,388 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 12:46:37,479 INFO L257 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2022-07-22 12:46:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:37,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:46:37,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:46:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:37,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:46:37,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:46:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:46:37,544 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:46:37,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 148 transitions. cyclomatic complexity: 102 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:37,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 148 transitions. cyclomatic complexity: 102. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 141 states and 352 transitions. Complement of second has 5 states. [2022-07-22 12:46:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:46:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-07-22 12:46:37,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:46:37,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:37,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:46:37,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:37,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 12:46:37,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:37,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 352 transitions. [2022-07-22 12:46:37,627 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 42 [2022-07-22 12:46:37,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 133 states and 334 transitions. [2022-07-22 12:46:37,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2022-07-22 12:46:37,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2022-07-22 12:46:37,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 334 transitions. [2022-07-22 12:46:37,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:46:37,631 INFO L220 hiAutomatonCegarLoop]: Abstraction has 133 states and 334 transitions. [2022-07-22 12:46:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 334 transitions. [2022-07-22 12:46:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2022-07-22 12:46:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 2.577319587628866) internal successors, (250), 96 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 250 transitions. [2022-07-22 12:46:37,643 INFO L242 hiAutomatonCegarLoop]: Abstraction has 97 states and 250 transitions. [2022-07-22 12:46:37,643 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 250 transitions. [2022-07-22 12:46:37,643 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:46:37,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 250 transitions. [2022-07-22 12:46:37,645 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 42 [2022-07-22 12:46:37,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:46:37,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:46:37,646 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:46:37,646 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:46:37,647 INFO L748 eck$LassoCheckResult]: Stem: 1079#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 973#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 975#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 1073#[thread1ENTRY, L81-4]don't care [518] L81-4-->L82-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= (select |v_#valid_127| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= |v_#memory_int_75| (store |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_ULTIMATE.start_main_#t~pre11#1_19| |v_#pthreadsForks_26|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_76|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_75|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] 1075#[thread1ENTRY, L82-3]don't care [427] L82-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_14|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_4|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~ret6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1077#[L82-4, thread2ENTRY, thread1ENTRY]don't care [411] thread2ENTRY-->L62-4: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] 1083#[L82-4, L62-4, thread1ENTRY]don't care [2022-07-22 12:46:37,647 INFO L750 eck$LassoCheckResult]: Loop: 1083#[L82-4, L62-4, thread1ENTRY]don't care [463] L62-4-->L65: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_21|))) (let ((.cse1 (+ .cse0 v_~A~0.offset_31))) (and (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_~tmp~1#1_7|) (<= (+ .cse0 v_~A~0.offset_31 4) (select |v_#length_58| v_~A~0.base_31)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_5| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_5|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_5|)) 1 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| (+ (* (- 1) |v_thread2Thread1of1ForFork1_minus_~b#1_5|) |v_thread2Thread1of1ForFork1_minus_~a#1_5|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_5| |v_thread2Thread1of1ForFork1_minus_#in~b#1_5|) (<= 0 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_5| |v_thread2Thread1of1ForFork1_minus_#in~a#1_5|) (< |v_thread2Thread1of1ForFork1_~i~1#1_21| v_~N~0_18) (= v_~counter~0_35 |v_thread2Thread1of1ForFork1_minus_#in~a#1_5|) (= (select |v_#valid_69| v_~A~0.base_31) 1) (= (select (select |v_#memory_int_49| v_~A~0.base_31) .cse1) |v_thread2Thread1of1ForFork1_minus_#in~b#1_5|)))) InVars {~counter~0=v_~counter~0_35, ~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_49|, #length=|v_#length_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_21|, ~N~0=v_~N~0_18} OutVars{~counter~0=v_~counter~0_35, ~A~0.base=v_~A~0.base_31, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_21|, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~A~0.offset=v_~A~0.offset_31, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_49|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_7|, #length=|v_#length_58|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_#t~ret6#1] 1085#[L82-4, L65, thread1ENTRY]don't care [517] L65-->L62-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_30|) |v_thread2Thread1of1ForFork1_~i~1#1_29|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_9| v_~counter~0_43)) InVars {thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_9|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_30|} OutVars{~counter~0=v_~counter~0_43, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_9|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_29|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_~i~1#1] 1083#[L82-4, L62-4, thread1ENTRY]don't care [2022-07-22 12:46:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash -271833180, now seen corresponding path program 1 times [2022-07-22 12:46:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:37,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590501071] [2022-07-22 12:46:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:37,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:37,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:37,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash 15831, now seen corresponding path program 1 times [2022-07-22 12:46:37,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:37,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386206924] [2022-07-22 12:46:37,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:37,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:37,728 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:37,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:37,748 INFO L85 PathProgramCache]: Analyzing trace with hash 761333946, now seen corresponding path program 1 times [2022-07-22 12:46:37,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:37,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528356081] [2022-07-22 12:46:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:37,765 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 12:46:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:37,836 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 12:46:37,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:46:37,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528356081] [2022-07-22 12:46:37,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528356081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:46:37,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:46:37,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:46:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791217515] [2022-07-22 12:46:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:46:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:46:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:46:37,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:46:37,965 INFO L87 Difference]: Start difference. First operand 97 states and 250 transitions. cyclomatic complexity: 180 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:46:38,041 INFO L93 Difference]: Finished difference Result 103 states and 248 transitions. [2022-07-22 12:46:38,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 248 transitions. [2022-07-22 12:46:38,043 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 34 [2022-07-22 12:46:38,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 80 states and 210 transitions. [2022-07-22 12:46:38,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2022-07-22 12:46:38,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2022-07-22 12:46:38,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 210 transitions. [2022-07-22 12:46:38,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:46:38,046 INFO L220 hiAutomatonCegarLoop]: Abstraction has 80 states and 210 transitions. [2022-07-22 12:46:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 210 transitions. [2022-07-22 12:46:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-22 12:46:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.625) internal successors, (210), 79 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 210 transitions. [2022-07-22 12:46:38,054 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 210 transitions. [2022-07-22 12:46:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:46:38,055 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 210 transitions. [2022-07-22 12:46:38,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:46:38,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 210 transitions. [2022-07-22 12:46:38,057 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 34 [2022-07-22 12:46:38,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:46:38,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:46:38,057 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:46:38,057 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:46:38,058 INFO L748 eck$LassoCheckResult]: Stem: 1384#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1284#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (= |v_#memory_int_81| (store |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (select |v_#valid_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_82|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_81|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 1286#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 1288#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 1376#[thread1ENTRY, L81-4]don't care [400] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 1356#[L49-4, L81-4]don't care [518] L81-4-->L82-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= (select |v_#valid_127| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= |v_#memory_int_75| (store |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_ULTIMATE.start_main_#t~pre11#1_19| |v_#pthreadsForks_26|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_76|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_75|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] 1358#[L82-3, L49-4]don't care [2022-07-22 12:46:38,059 INFO L750 eck$LassoCheckResult]: Loop: 1358#[L82-3, L49-4]don't care [430] L49-4-->L52: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_15| 4))) (let ((.cse0 (+ .cse2 v_~A~0.offset_27)) (.cse1 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|))) (and (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0))) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| v_~counter~0_29) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| |v_thread1Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| .cse1) (<= (+ .cse2 v_~A~0.offset_27 4) (select |v_#length_38| v_~A~0.base_27)) (= (select |v_#valid_43| v_~A~0.base_27) 1) (= (select (select |v_#memory_int_35| v_~A~0.base_27) .cse0) |v_thread1Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_~tmp~0#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (< |v_thread1Thread1of1ForFork0_~i~0#1_15| v_~N~0_8)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~N~0=v_~N~0_8} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_7|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] 1430#[L82-3, L52]don't care [519] L52-->L49-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_29| (+ |v_thread1Thread1of1ForFork0_~i~0#1_30| 1)) (= |v_thread1Thread1of1ForFork0_~tmp~0#1_11| v_~counter~0_45)) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_30|} OutVars{~counter~0=v_~counter~0_45, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1] 1358#[L82-3, L49-4]don't care [2022-07-22 12:46:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -272430691, now seen corresponding path program 1 times [2022-07-22 12:46:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:38,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403293817] [2022-07-22 12:46:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:38,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:38,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash 14810, now seen corresponding path program 3 times [2022-07-22 12:46:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:38,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809601290] [2022-07-22 12:46:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:38,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:38,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash 187124854, now seen corresponding path program 1 times [2022-07-22 12:46:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:38,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66550956] [2022-07-22 12:46:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:38,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:38,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:39,381 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:46:39,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:46:39,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:46:39,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:46:39,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:46:39,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:39,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:46:39,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:46:39,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:46:39,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:46:39,383 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:46:39,387 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 12:46:39,389 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 12:46:39,390 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 12:46:39,392 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 12:46:39,393 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 12:46:39,395 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 12:46:39,396 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 12:46:39,402 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 12:46:39,406 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 12:46:40,135 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 12:46:40,138 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 12:46:40,139 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 12:46:40,141 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 12:46:40,142 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 12:46:40,144 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 12:46:40,149 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 12:46:40,151 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 12:46:40,153 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 12:46:40,155 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 12:46:40,157 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 12:46:40,159 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 12:46:40,160 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 12:46:40,162 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 12:46:40,164 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 12:46:40,165 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 12:46:40,166 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 12:46:40,168 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 12:46:40,170 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 12:46:40,933 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:46:40,933 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:46:40,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:40,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:40,934 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 12:46:40,937 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 12:46:40,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:40,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:40,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:40,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:40,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:40,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:40,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:40,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:40,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:40,968 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 12:46:40,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:40,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:40,969 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 12:46:40,971 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 12:46:40,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:40,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:40,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:40,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:40,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:40,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:40,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:40,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:40,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:46:41,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,002 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 12:46:41,003 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 12:46:41,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:41,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:41,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:41,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:41,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,035 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 12:46:41,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,036 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 12:46:41,037 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 12:46:41,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:41,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:41,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:41,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:41,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,067 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 12:46:41,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,068 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 12:46:41,069 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 12:46:41,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 12:46:41,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:41,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:41,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:41,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,102 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 12:46:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,103 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 12:46:41,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:41,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,120 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 12:46:41,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,142 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 12:46:41,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,143 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 12:46:41,144 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 12:46:41,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:41,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:41,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:41,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:41,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,175 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 12:46:41,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,176 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 12:46:41,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:41,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:41,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:41,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:41,191 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 12:46:41,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,231 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 12:46:41,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,233 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 12:46:41,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 12:46:41,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,249 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 12:46:41,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,288 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 12:46:41,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,290 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 12:46:41,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:41,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,306 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 12:46:41,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,348 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 12:46:41,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,349 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 12:46:41,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:41,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,366 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 12:46:41,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:41,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,397 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 12:46:41,399 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 12:46:41,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:41,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,431 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 12:46:41,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,433 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 12:46:41,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:41,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,447 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 12:46:41,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 12:46:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,477 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 12:46:41,494 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 12:46:41,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:41,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:41,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,561 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 12:46:41,562 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 12:46:41,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:41,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:41,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 12:46:41,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,596 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 12:46:41,598 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 12:46:41,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:41,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:41,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:41,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:41,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:41,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:41,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:41,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:46:41,662 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-22 12:46:41,663 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-07-22 12:46:41,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:41,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:41,664 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 12:46:41,674 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 12:46:41,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:46:41,681 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:46:41,682 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:46:41,682 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_~i~0#1, ~N~0) = -1*thread1Thread1of1ForFork0_~i~0#1 + 1*~N~0 Supporting invariants [] [2022-07-22 12:46:41,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:41,829 INFO L257 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-22 12:46:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:41,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:46:41,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:46:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:41,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:46:41,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:46:41,895 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 12:46:41,896 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:46:41,896 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 210 transitions. cyclomatic complexity: 153 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:41,967 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 210 transitions. cyclomatic complexity: 153. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 133 states and 339 transitions. Complement of second has 5 states. [2022-07-22 12:46:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:46:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-07-22 12:46:41,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:46:41,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:41,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:46:41,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:41,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-22 12:46:41,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:41,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 339 transitions. [2022-07-22 12:46:41,976 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 36 [2022-07-22 12:46:41,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 127 states and 327 transitions. [2022-07-22 12:46:41,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-22 12:46:41,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2022-07-22 12:46:41,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 327 transitions. [2022-07-22 12:46:41,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:46:41,983 INFO L220 hiAutomatonCegarLoop]: Abstraction has 127 states and 327 transitions. [2022-07-22 12:46:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 327 transitions. [2022-07-22 12:46:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 78. [2022-07-22 12:46:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 2.628205128205128) internal successors, (205), 77 states have internal predecessors, (205), 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 12:46:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 205 transitions. [2022-07-22 12:46:42,001 INFO L242 hiAutomatonCegarLoop]: Abstraction has 78 states and 205 transitions. [2022-07-22 12:46:42,001 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 205 transitions. [2022-07-22 12:46:42,001 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:46:42,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 205 transitions. [2022-07-22 12:46:42,002 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2022-07-22 12:46:42,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:46:42,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:46:42,003 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:46:42,003 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:46:42,010 INFO L748 eck$LassoCheckResult]: Stem: 1835#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1737#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (= |v_#memory_int_81| (store |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (select |v_#valid_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_82|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_81|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 1739#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 1741#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 1829#[thread1ENTRY, L81-4]don't care [400] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 1809#[L49-4, L81-4]don't care [518] L81-4-->L82-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= (select |v_#valid_127| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= |v_#memory_int_75| (store |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_ULTIMATE.start_main_#t~pre11#1_19| |v_#pthreadsForks_26|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_76|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_75|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] 1811#[L82-3, L49-4]don't care [427] L82-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_14|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_4|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~ret6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1863#[L49-4, L82-4, thread2ENTRY]don't care [2022-07-22 12:46:42,010 INFO L750 eck$LassoCheckResult]: Loop: 1863#[L49-4, L82-4, thread2ENTRY]don't care [430] L49-4-->L52: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_15| 4))) (let ((.cse0 (+ .cse2 v_~A~0.offset_27)) (.cse1 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|))) (and (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0))) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| v_~counter~0_29) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| |v_thread1Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| .cse1) (<= (+ .cse2 v_~A~0.offset_27 4) (select |v_#length_38| v_~A~0.base_27)) (= (select |v_#valid_43| v_~A~0.base_27) 1) (= (select (select |v_#memory_int_35| v_~A~0.base_27) .cse0) |v_thread1Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_~tmp~0#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (< |v_thread1Thread1of1ForFork0_~i~0#1_15| v_~N~0_8)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~N~0=v_~N~0_8} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_7|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] 1879#[L52, L82-4, thread2ENTRY]don't care [519] L52-->L49-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_29| (+ |v_thread1Thread1of1ForFork0_~i~0#1_30| 1)) (= |v_thread1Thread1of1ForFork0_~tmp~0#1_11| v_~counter~0_45)) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_30|} OutVars{~counter~0=v_~counter~0_45, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1] 1863#[L49-4, L82-4, thread2ENTRY]don't care [2022-07-22 12:46:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash 144583598, now seen corresponding path program 1 times [2022-07-22 12:46:42,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:42,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064346657] [2022-07-22 12:46:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:42,044 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:42,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 14810, now seen corresponding path program 4 times [2022-07-22 12:46:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:42,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83212780] [2022-07-22 12:46:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:42,084 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:42,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1505898055, now seen corresponding path program 1 times [2022-07-22 12:46:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:42,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885457886] [2022-07-22 12:46:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:42,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:42,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:43,516 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:46:43,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:46:43,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:46:43,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:46:43,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:46:43,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:43,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:46:43,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:46:43,517 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:46:43,517 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:46:43,517 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:46:43,521 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 12:46:43,527 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 12:46:43,531 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 12:46:43,532 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 12:46:43,534 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 12:46:43,536 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 12:46:43,539 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 12:46:43,541 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 12:46:43,542 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 12:46:43,544 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 12:46:43,545 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 12:46:43,550 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 12:46:43,551 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 12:46:43,552 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 12:46:43,555 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 12:46:43,556 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 12:46:43,558 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 12:46:43,560 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 12:46:43,561 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 12:46:43,563 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 12:46:43,565 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 12:46:43,567 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 12:46:43,568 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 12:46:43,570 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 12:46:43,571 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 12:46:43,573 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 12:46:43,575 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 12:46:43,585 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 12:46:43,587 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 12:46:43,588 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 12:46:43,589 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 12:46:43,591 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 12:46:43,594 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 12:46:43,596 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 12:46:43,597 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 12:46:43,598 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 12:46:43,599 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 12:46:43,601 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 12:46:43,602 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 12:46:43,603 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 12:46:43,605 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 12:46:43,606 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 12:46:44,356 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 12:46:44,358 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 12:46:44,364 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 12:46:45,164 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:46:45,165 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:46:45,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,166 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 12:46:45,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:45,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,179 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 12:46:45,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:45,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,204 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 12:46:45,205 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 12:46:45,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 12:46:45,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,241 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 12:46:45,264 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 12:46:45,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:45,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 12:46:45,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,298 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 12:46:45,299 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 12:46:45,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:45,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:45,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,357 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 12:46:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,359 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 12:46:45,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:45,369 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 12:46:45,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 12:46:45,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,399 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 12:46:45,399 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 12:46:45,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:45,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 12:46:45,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,431 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 12:46:45,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 12:46:45,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:45,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,464 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 12:46:45,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:45,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:45,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:45,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,529 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 12:46:45,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-22 12:46:45,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,586 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 12:46:45,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:45,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:45,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-22 12:46:45,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,623 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 12:46:45,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-22 12:46:45,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,658 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 12:46:45,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-22 12:46:45,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,689 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:45,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 12:46:45,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:45,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:45,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-22 12:46:45,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,727 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 12:46:45,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 12:46:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,759 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 12:46:45,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 12:46:45,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,792 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 12:46:45,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:45,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,825 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 12:46:45,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:45,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,857 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 12:46:45,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:45,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:45,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:45,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 12:46:45,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,894 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 12:46:45,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:45,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,929 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 12:46:45,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:45,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:45,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,961 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-22 12:46:45,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:45,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:45,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:45,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:45,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:45,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:45,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:45,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:45,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:45,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-22 12:46:45,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:45,994 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:45,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-22 12:46:45,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-22 12:46:46,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,027 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-22 12:46:46,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 12:46:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,061 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-22 12:46:46,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 12:46:46,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,099 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,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 12:46:46,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-22 12:46:46,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:46,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,155 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-22 12:46:46,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:46,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,190 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-22 12:46:46,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 12:46:46,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,226 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-22 12:46:46,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-22 12:46:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,259 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 12:46:46,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-22 12:46:46,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,292 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 12:46:46,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-22 12:46:46,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,327 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-22 12:46:46,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 12:46:46,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,364 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 12:46:46,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-22 12:46:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,397 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 12:46:46,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-22 12:46:46,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,429 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-22 12:46:46,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-07-22 12:46:46,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,461 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 12:46:46,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:46,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,495 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 12:46:46,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-22 12:46:46,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,529 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-22 12:46:46,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-22 12:46:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,569 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 12:46:46,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-22 12:46:46,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,602 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 12:46:46,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-22 12:46:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,637 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 12:46:46,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:46:46,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:46:46,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:46:46,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:46,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,674 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 12:46:46,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:46,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,720 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 12:46:46,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:46:46,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,728 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:46:46,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,731 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:46:46,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-22 12:46:46,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,762 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 12:46:46,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:46,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,798 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-22 12:46:46,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:46,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,835 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 12:46:46,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:46,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,875 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 12:46:46,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:46:46,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-22 12:46:46,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,909 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 12:46:46,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 12:46:46,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:46:46,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:46:46,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:46:46,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:46:46,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:46:46,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:46:46,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:46:46,957 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-22 12:46:46,957 INFO L444 ModelExtractionUtils]: 20 out of 37 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-22 12:46:46,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:46:46,958 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:46:46,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 12:46:46,959 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:46:46,968 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:46:46,968 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:46:46,968 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_~i~0#1, ~N~0) = -1*thread1Thread1of1ForFork0_~i~0#1 + 1*~N~0 Supporting invariants [] [2022-07-22 12:46:46,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:47,114 INFO L257 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-22 12:46:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:47,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:46:47,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:46:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:46:47,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:46:47,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:46:47,186 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 12:46:47,187 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:46:47,187 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 205 transitions. cyclomatic complexity: 149 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:47,248 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 205 transitions. cyclomatic complexity: 149. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 127 states and 327 transitions. Complement of second has 5 states. [2022-07-22 12:46:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:46:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:46:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-07-22 12:46:47,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:46:47,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:47,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:46:47,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:47,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:46:47,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:46:47,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 327 transitions. [2022-07-22 12:46:47,256 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 34 [2022-07-22 12:46:47,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 315 transitions. [2022-07-22 12:46:47,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-22 12:46:47,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2022-07-22 12:46:47,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 315 transitions. [2022-07-22 12:46:47,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:46:47,259 INFO L220 hiAutomatonCegarLoop]: Abstraction has 121 states and 315 transitions. [2022-07-22 12:46:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 315 transitions. [2022-07-22 12:46:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2022-07-22 12:46:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 2.6052631578947367) internal successors, (198), 75 states have internal predecessors, (198), 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 12:46:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 198 transitions. [2022-07-22 12:46:47,272 INFO L242 hiAutomatonCegarLoop]: Abstraction has 76 states and 198 transitions. [2022-07-22 12:46:47,272 INFO L425 stractBuchiCegarLoop]: Abstraction has 76 states and 198 transitions. [2022-07-22 12:46:47,272 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:46:47,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 198 transitions. [2022-07-22 12:46:47,273 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 30 [2022-07-22 12:46:47,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:46:47,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:46:47,274 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:46:47,274 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:46:47,275 INFO L748 eck$LassoCheckResult]: Stem: 2281#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2197#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (= |v_#memory_int_81| (store |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_82| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (select |v_#valid_143| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_82|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_81|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 2199#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_43) (= 1 (select |v_#valid_149| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|)) |v_#memory_int_85|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_116| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_43) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_30|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_86|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_43, #pthreadsForks=|v_#pthreadsForks_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_85|, #length=|v_#length_116|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 2201#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 2275#[thread1ENTRY, L81-4]don't care [518] L81-4-->L82-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= (select |v_#valid_127| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= |v_#memory_int_75| (store |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_ULTIMATE.start_main_#t~pre11#1_19| |v_#pthreadsForks_26|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_76|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_75|, #length=|v_#length_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] 2277#[thread1ENTRY, L82-3]don't care [427] L82-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_14|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_4|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~ret6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2279#[L82-4, thread2ENTRY, thread1ENTRY]don't care [411] thread2ENTRY-->L62-4: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] 2285#[L82-4, L62-4, thread1ENTRY]don't care [2022-07-22 12:46:47,275 INFO L750 eck$LassoCheckResult]: Loop: 2285#[L82-4, L62-4, thread1ENTRY]don't care [463] L62-4-->L65: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_21|))) (let ((.cse1 (+ .cse0 v_~A~0.offset_31))) (and (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_~tmp~1#1_7|) (<= (+ .cse0 v_~A~0.offset_31 4) (select |v_#length_58| v_~A~0.base_31)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_5| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_5|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_5|)) 1 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| (+ (* (- 1) |v_thread2Thread1of1ForFork1_minus_~b#1_5|) |v_thread2Thread1of1ForFork1_minus_~a#1_5|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_5| |v_thread2Thread1of1ForFork1_minus_#in~b#1_5|) (<= 0 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_5| |v_thread2Thread1of1ForFork1_minus_#in~a#1_5|) (< |v_thread2Thread1of1ForFork1_~i~1#1_21| v_~N~0_18) (= v_~counter~0_35 |v_thread2Thread1of1ForFork1_minus_#in~a#1_5|) (= (select |v_#valid_69| v_~A~0.base_31) 1) (= (select (select |v_#memory_int_49| v_~A~0.base_31) .cse1) |v_thread2Thread1of1ForFork1_minus_#in~b#1_5|)))) InVars {~counter~0=v_~counter~0_35, ~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_49|, #length=|v_#length_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_21|, ~N~0=v_~N~0_18} OutVars{~counter~0=v_~counter~0_35, ~A~0.base=v_~A~0.base_31, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_21|, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~A~0.offset=v_~A~0.offset_31, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_49|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_7|, #length=|v_#length_58|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_#t~ret6#1] 2289#[L82-4, L65, thread1ENTRY]don't care [517] L65-->L62-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_30|) |v_thread2Thread1of1ForFork1_~i~1#1_29|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_9| v_~counter~0_43)) InVars {thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_9|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_30|} OutVars{~counter~0=v_~counter~0_43, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_9|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_29|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_~i~1#1] 2285#[L82-4, L62-4, thread1ENTRY]don't care [2022-07-22 12:46:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 144694159, now seen corresponding path program 1 times [2022-07-22 12:46:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:47,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4599317] [2022-07-22 12:46:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:47,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:47,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:47,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash 15831, now seen corresponding path program 2 times [2022-07-22 12:46:47,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:47,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982280086] [2022-07-22 12:46:47,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:47,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:47,314 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:47,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:46:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1612148197, now seen corresponding path program 1 times [2022-07-22 12:46:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:46:47,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114645930] [2022-07-22 12:46:47,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:46:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:46:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:47,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:46:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:46:47,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:46:47,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 12:46:48,707 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:46:48,707 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:46:48,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:46:48,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:46:48,708 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:46:48,708 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:46:48,708 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:46:48,708 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:46:48,708 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration7_Lasso [2022-07-22 12:46:48,708 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:46:48,708 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:46:48,713 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 12:46:48,717 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 12:46:48,718 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 12:46:48,719 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 12:46:48,720 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 12:46:48,722 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 12:46:48,724 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 12:46:48,725 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 12:46:48,727 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 12:46:48,734 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 12:46:48,735 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 12:46:48,737 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 12:46:48,738 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 12:46:48,740 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 12:46:48,741 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 12:46:48,742 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 12:46:48,744 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 12:46:48,746 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 12:46:48,747 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 12:46:48,749 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 12:46:48,750 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 12:46:48,751 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 12:46:48,753 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 12:46:48,754 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 12:46:48,757 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 12:46:48,758 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 12:46:48,759 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 12:46:48,761 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 12:46:48,763 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 12:46:48,765 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 12:46:48,766 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 12:46:48,769 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 12:46:48,771 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 12:46:48,772 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 12:46:48,961 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 12:46:48,967 INFO L158 Benchmark]: Toolchain (without parser) took 24548.80ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 128.5MB in the beginning and 175.9MB in the end (delta: -47.4MB). Peak memory consumption was 173.3MB. Max. memory is 8.0GB. [2022-07-22 12:46:48,967 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:46:48,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.71ms. Allocated memory is still 153.1MB. Free memory was 128.2MB in the beginning and 117.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:46:48,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.07ms. Allocated memory is still 153.1MB. Free memory was 117.3MB in the beginning and 115.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:46:48,968 INFO L158 Benchmark]: Boogie Preprocessor took 39.29ms. Allocated memory is still 153.1MB. Free memory was 115.0MB in the beginning and 113.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:46:48,968 INFO L158 Benchmark]: RCFGBuilder took 739.87ms. Allocated memory is still 153.1MB. Free memory was 113.5MB in the beginning and 91.5MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-07-22 12:46:48,971 INFO L158 Benchmark]: BuchiAutomizer took 23405.36ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 91.2MB in the beginning and 175.9MB in the end (delta: -84.7MB). Peak memory consumption was 135.6MB. Max. memory is 8.0GB. [2022-07-22 12:46:48,973 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.19ms. Allocated memory is still 153.1MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 303.71ms. Allocated memory is still 153.1MB. Free memory was 128.2MB in the beginning and 117.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.07ms. Allocated memory is still 153.1MB. Free memory was 117.3MB in the beginning and 115.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.29ms. Allocated memory is still 153.1MB. Free memory was 115.0MB in the beginning and 113.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 739.87ms. Allocated memory is still 153.1MB. Free memory was 113.5MB in the beginning and 91.5MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 23405.36ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 91.2MB in the beginning and 175.9MB in the end (delta: -84.7MB). Peak memory consumption was 135.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 112 PlacesBefore, 23 PlacesAfterwards, 114 TransitionsBefore, 19 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 113 TotalNumberOfCompositions, 874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 679, positive: 641, positive conditional: 0, positive unconditional: 641, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 315, positive: 305, positive conditional: 0, positive unconditional: 305, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 679, positive: 336, positive conditional: 0, positive unconditional: 336, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 315, unknown conditional: 0, unknown unconditional: 315] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - 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 12:46:49,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...