/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-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:19:18,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:19:18,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:19:18,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:19:18,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:19:18,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:19:18,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:19:18,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:19:18,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:19:18,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:19:18,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:19:18,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:19:18,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:19:18,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:19:18,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:19:18,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:19:18,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:19:18,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:19:18,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:19:18,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:19:18,862 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:19:18,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:19:18,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:19:18,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:19:18,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:19:18,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:19:18,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:19:18,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:19:18,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:19:18,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:19:18,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:19:18,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:19:18,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:19:18,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:19:18,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:19:18,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:19:18,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:19:18,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:19:18,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:19:18,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:19:18,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:19:18,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:19:18,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:19:18,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:19:18,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:19:18,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:19:18,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:19:18,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:19:18,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:19:18,910 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:19:18,910 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:19:18,910 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:19:18,910 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:19:18,910 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:19:18,911 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:19:18,911 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:19:18,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:19:18,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:19:18,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:19:18,913 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:19:18,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:19:18,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:19:18,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:19:18,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:19:18,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:19:18,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:19:18,913 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:19:18,914 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:19:18,914 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-26 14:19:19,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:19:19,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:19:19,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:19:19,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:19:19,123 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:19:19,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-07-26 14:19:19,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e94ae88/7b32596b9e7341ea86e2c071748bd42e/FLAGba16a8d30 [2022-07-26 14:19:19,584 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:19:19,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-07-26 14:19:19,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e94ae88/7b32596b9e7341ea86e2c071748bd42e/FLAGba16a8d30 [2022-07-26 14:19:19,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e94ae88/7b32596b9e7341ea86e2c071748bd42e [2022-07-26 14:19:19,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:19:19,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:19:19,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:19:19,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:19:19,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:19:19,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57084530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19, skipping insertion in model container [2022-07-26 14:19:19,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:19:19,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:19:19,771 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-simple-array-sum.wvr.c[2690,2703] [2022-07-26 14:19:19,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:19:19,779 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:19:19,793 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-simple-array-sum.wvr.c[2690,2703] [2022-07-26 14:19:19,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:19:19,804 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:19:19,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19 WrapperNode [2022-07-26 14:19:19,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:19:19,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:19:19,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:19:19,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:19:19,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,832 INFO L137 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 120 [2022-07-26 14:19:19,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:19:19,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:19:19,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:19:19,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:19:19,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:19:19,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:19:19,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:19:19,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:19:19,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (1/1) ... [2022-07-26 14:19:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:19,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:19,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:19,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 14:19:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:19:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:19:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:19:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:19:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:19:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:19:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:19:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:19:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-26 14:19:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-26 14:19:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:19:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:19:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:19:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:19:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:19:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:19:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:19:19,978 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:19:20,079 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:19:20,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:19:20,333 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:19:20,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:19:20,356 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-26 14:19:20,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:19:20 BoogieIcfgContainer [2022-07-26 14:19:20,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:19:20,358 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:19:20,358 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:19:20,366 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:19:20,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:19:20,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:19:19" (1/3) ... [2022-07-26 14:19:20,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ec35e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:19:20, skipping insertion in model container [2022-07-26 14:19:20,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:19:20,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:19:19" (2/3) ... [2022-07-26 14:19:20,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ec35e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:19:20, skipping insertion in model container [2022-07-26 14:19:20,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:19:20,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:19:20" (3/3) ... [2022-07-26 14:19:20,370 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-07-26 14:19:20,464 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-26 14:19:20,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 187 transitions, 398 flow [2022-07-26 14:19:20,552 INFO L129 PetriNetUnfolder]: 16/181 cut-off events. [2022-07-26 14:19:20,552 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 14:19:20,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 16/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2022-07-26 14:19:20,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 187 transitions, 398 flow [2022-07-26 14:19:20,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 181 transitions, 380 flow [2022-07-26 14:19:20,569 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:19:20,577 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 181 transitions, 380 flow [2022-07-26 14:19:20,579 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 181 transitions, 380 flow [2022-07-26 14:19:20,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 181 transitions, 380 flow [2022-07-26 14:19:20,614 INFO L129 PetriNetUnfolder]: 16/181 cut-off events. [2022-07-26 14:19:20,615 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 14:19:20,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 16/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2022-07-26 14:19:20,618 INFO L116 LiptonReduction]: Number of co-enabled transitions 1720 [2022-07-26 14:19:24,982 INFO L131 LiptonReduction]: Checked pairs total: 2482 [2022-07-26 14:19:24,982 INFO L133 LiptonReduction]: Total number of compositions: 186 [2022-07-26 14:19:24,998 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:19:24,998 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:19:24,998 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:19:24,999 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:19:24,999 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:19:24,999 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:19:24,999 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:19:24,999 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:19:25,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:19:25,065 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 128 [2022-07-26 14:19:25,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:25,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:25,069 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:19:25,069 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:25,069 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:19:25,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 171 states, but on-demand construction may add more states [2022-07-26 14:19:25,082 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 128 [2022-07-26 14:19:25,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:25,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:25,082 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:19:25,082 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:25,085 INFO L733 eck$LassoCheckResult]: Stem: 181#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 184#[L113-6]don't care [2022-07-26 14:19:25,086 INFO L735 eck$LassoCheckResult]: Loop: 184#[L113-6]don't care [641] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_129| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|)) (= (select |v_#valid_162| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) 1) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|) (= (store |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57| (store (select |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|)) |v_#memory_int_99|)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_100|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_99|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_35|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 184#[L113-6]don't care [2022-07-26 14:19:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 707, now seen corresponding path program 1 times [2022-07-26 14:19:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:25,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21598494] [2022-07-26 14:19:25,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:25,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:25,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash 672, now seen corresponding path program 1 times [2022-07-26 14:19:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:25,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384440526] [2022-07-26 14:19:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:25,204 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:25,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:25,210 INFO L85 PathProgramCache]: Analyzing trace with hash 22558, now seen corresponding path program 1 times [2022-07-26 14:19:25,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:25,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976226137] [2022-07-26 14:19:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:25,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:25,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:25,860 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:25,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:25,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:25,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:25,860 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:25,860 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:25,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:25,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:25,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-array-sum.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:19:25,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:25,861 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:25,879 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,884 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,886 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,888 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,891 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,893 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,896 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,902 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,904 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,906 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,907 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,908 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,911 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,913 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:25,915 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,171 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,173 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,175 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,177 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,178 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,180 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,181 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,183 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,184 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,186 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,188 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,190 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,191 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,193 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,195 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,197 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,199 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,200 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,202 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,204 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,205 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,207 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,208 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,210 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,211 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:26,563 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:26,566 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:26,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-26 14:19:26,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-26 14:19:26,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:26,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:26,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:26,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-26 14:19:26,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:26,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:26,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:26,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:26,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:26,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-26 14:19:26,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:26,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:26,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:26,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:26,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-26 14:19:26,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,703 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-26 14:19:26,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:26,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:26,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:26,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:26,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-26 14:19:26,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:26,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:26,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:26,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:26,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,815 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-26 14:19:26,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:26,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:26,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:26,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:26,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:26,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-26 14:19:26,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:26,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:26,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:26,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:26,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:26,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,902 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-26 14:19:26,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:26,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:26,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:26,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:26,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,946 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-26 14:19:26,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:26,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:26,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:26,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:26,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:26,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:26,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:26,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:26,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:26,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:26,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:26,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:26,987 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:26,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-26 14:19:26,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:27,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:27,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:27,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,029 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-26 14:19:27,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:27,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:27,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:27,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,067 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-26 14:19:27,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,112 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-26 14:19:27,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,164 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-26 14:19:27,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-26 14:19:27,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,198 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-26 14:19:27,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,240 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-26 14:19:27,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,288 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-26 14:19:27,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:27,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:27,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:27,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,328 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-26 14:19:27,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,370 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-26 14:19:27,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,385 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 14:19:27,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,388 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 14:19:27,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-26 14:19:27,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,421 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-26 14:19:27,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,463 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-26 14:19:27,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:27,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-26 14:19:27,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,499 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-26 14:19:27,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:27,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:27,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:27,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:27,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:27,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:27,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:27,527 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:27,541 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-26 14:19:27,541 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-26 14:19:27,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:27,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:27,543 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:27,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-26 14:19:27,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:27,584 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:19:27,584 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:27,584 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_uint_array_~i~3#1, v_rep(select #length ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base)_1) = -2*ULTIMATE.start_create_fresh_uint_array_~i~3#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base)_1 - 2*ULTIMATE.start_create_fresh_uint_array_~size#1 >= 0] [2022-07-26 14:19:27,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:27,667 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-07-26 14:19:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:27,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:19:27,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:27,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:19:27,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:27,763 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:19:27,764 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 171 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:27,805 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 171 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 174 states and 578 transitions. Complement of second has 3 states. [2022-07-26 14:19:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-26 14:19:27,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:19:27,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:27,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:19:27,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:27,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:19:27,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:27,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 578 transitions. [2022-07-26 14:19:27,815 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-26 14:19:27,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 166 states and 559 transitions. [2022-07-26 14:19:27,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2022-07-26 14:19:27,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2022-07-26 14:19:27,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 559 transitions. [2022-07-26 14:19:27,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:27,824 INFO L220 hiAutomatonCegarLoop]: Abstraction has 166 states and 559 transitions. [2022-07-26 14:19:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 559 transitions. [2022-07-26 14:19:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2022-07-26 14:19:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 3.375757575757576) internal successors, (557), 164 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 557 transitions. [2022-07-26 14:19:27,850 INFO L242 hiAutomatonCegarLoop]: Abstraction has 165 states and 557 transitions. [2022-07-26 14:19:27,850 INFO L426 stractBuchiCegarLoop]: Abstraction has 165 states and 557 transitions. [2022-07-26 14:19:27,850 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:19:27,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 557 transitions. [2022-07-26 14:19:27,852 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-26 14:19:27,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:27,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:27,852 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-26 14:19:27,852 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:27,852 INFO L733 eck$LassoCheckResult]: Stem: 1139#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 909#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= (select |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45| v_~N~0_92) (= v_~A~0.base_45 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_45) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (store |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_238|) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (= (store |v_#length_186| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_185|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_239|, #length=|v_#length_186|, ~N~0=v_~N~0_92, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_92, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_238|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_185|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 843#[L113-14]don't care [2022-07-26 14:19:27,853 INFO L735 eck$LassoCheckResult]: Loop: 843#[L113-14]don't care [636] L113-14-->L113-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0))) (and (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0 4) (select |v_#length_119| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|)) (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|))) (= (select |v_#valid_152| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) 1) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_94|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_93|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_33|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 843#[L113-14]don't care [2022-07-26 14:19:27,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash 22592, now seen corresponding path program 1 times [2022-07-26 14:19:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:27,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403036730] [2022-07-26 14:19:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:27,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:27,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:27,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:27,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash 667, now seen corresponding path program 1 times [2022-07-26 14:19:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:27,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108122370] [2022-07-26 14:19:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:27,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:27,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:27,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:27,896 INFO L85 PathProgramCache]: Analyzing trace with hash 700988, now seen corresponding path program 1 times [2022-07-26 14:19:27,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:27,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174453746] [2022-07-26 14:19:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:27,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:27,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174453746] [2022-07-26 14:19:27,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174453746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:27,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:27,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:19:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828263098] [2022-07-26 14:19:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:19:27,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:19:27,980 INFO L87 Difference]: Start difference. First operand 165 states and 557 transitions. cyclomatic complexity: 456 Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:28,072 INFO L93 Difference]: Finished difference Result 489 states and 1660 transitions. [2022-07-26 14:19:28,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 489 states and 1660 transitions. [2022-07-26 14:19:28,077 INFO L131 ngComponentsAnalysis]: Automaton has 187 accepting balls. 379 [2022-07-26 14:19:28,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 489 states to 489 states and 1660 transitions. [2022-07-26 14:19:28,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 488 [2022-07-26 14:19:28,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2022-07-26 14:19:28,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 489 states and 1660 transitions. [2022-07-26 14:19:28,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:28,086 INFO L220 hiAutomatonCegarLoop]: Abstraction has 489 states and 1660 transitions. [2022-07-26 14:19:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 1660 transitions. [2022-07-26 14:19:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 166. [2022-07-26 14:19:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 166 states have (on average 3.36144578313253) internal successors, (558), 165 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 558 transitions. [2022-07-26 14:19:28,096 INFO L242 hiAutomatonCegarLoop]: Abstraction has 166 states and 558 transitions. [2022-07-26 14:19:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:19:28,097 INFO L426 stractBuchiCegarLoop]: Abstraction has 166 states and 558 transitions. [2022-07-26 14:19:28,097 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:19:28,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 558 transitions. [2022-07-26 14:19:28,098 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-26 14:19:28,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:28,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:28,099 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:19:28,099 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:28,099 INFO L733 eck$LassoCheckResult]: Stem: 1971#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1739#[L113-6]don't care [641] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_129| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|)) (= (select |v_#valid_162| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) 1) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|) (= (store |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57| (store (select |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|)) |v_#memory_int_99|)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_100|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_99|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_35|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 1741#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= (select |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45| v_~N~0_92) (= v_~A~0.base_45 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_45) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (store |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_238|) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (= (store |v_#length_186| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_185|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_239|, #length=|v_#length_186|, ~N~0=v_~N~0_92, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_92, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_238|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_185|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1743#[L113-14]don't care [2022-07-26 14:19:28,099 INFO L735 eck$LassoCheckResult]: Loop: 1743#[L113-14]don't care [636] L113-14-->L113-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0))) (and (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0 4) (select |v_#length_119| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|)) (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|))) (= (select |v_#valid_152| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) 1) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_94|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_93|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_33|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 1743#[L113-14]don't care [2022-07-26 14:19:28,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash 699973, now seen corresponding path program 1 times [2022-07-26 14:19:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:28,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484902333] [2022-07-26 14:19:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:28,117 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:28,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash 667, now seen corresponding path program 2 times [2022-07-26 14:19:28,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:28,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029298774] [2022-07-26 14:19:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:28,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:28,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:28,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash 21699799, now seen corresponding path program 1 times [2022-07-26 14:19:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:28,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369565457] [2022-07-26 14:19:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:28,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:28,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:28,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-26 14:19:29,147 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:29,147 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:29,147 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:29,147 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:29,147 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:29,147 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:29,147 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:29,147 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:29,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-array-sum.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 14:19:29,147 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:29,147 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:29,150 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,154 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,156 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,158 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,160 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,162 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,164 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,166 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,167 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,169 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,172 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,173 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,175 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,177 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,179 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,181 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,183 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,184 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,549 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,551 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,553 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,555 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,556 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,558 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,561 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,563 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,565 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,566 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,570 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,571 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,573 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,574 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,576 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,577 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,579 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,580 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,582 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,583 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:29,964 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:29,964 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:29,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:29,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:29,970 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:29,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-26 14:19:29,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:29,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:29,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:29,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:29,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:29,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:29,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:29,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:29,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:29,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:29,996 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:29,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-26 14:19:29,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-26 14:19:30,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,038 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-26 14:19:30,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-26 14:19:30,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,078 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-26 14:19:30,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,109 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-26 14:19:30,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,138 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-26 14:19:30,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:30,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:30,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:30,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,178 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 14:19:30,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,211 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 14:19:30,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:30,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:30,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:30,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,238 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 14:19:30,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:30,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:30,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:30,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,279 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 14:19:30,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,320 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 14:19:30,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:30,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:30,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:30,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,368 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 14:19:30,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:30,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:30,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:30,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 14:19:30,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,401 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 14:19:30,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,441 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 14:19:30,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:30,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:30,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:30,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,517 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-26 14:19:30,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-26 14:19:30,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,543 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-26 14:19:30,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-26 14:19:30,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,569 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-26 14:19:30,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:30,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:30,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:30,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-26 14:19:30,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,609 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-26 14:19:30,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,650 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-26 14:19:30,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-26 14:19:30,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,684 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-26 14:19:30,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-26 14:19:30,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,725 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-26 14:19:30,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,754 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-26 14:19:30,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,794 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-26 14:19:30,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,820 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-26 14:19:30,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:30,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:30,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:30,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,844 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-26 14:19:30,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,889 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-26 14:19:30,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:30,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:30,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,915 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-26 14:19:30,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:30,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:30,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:30,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:30,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:30,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:30,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:30,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:30,974 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-26 14:19:30,974 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-26 14:19:30,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:30,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:30,975 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:30,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-26 14:19:30,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:30,983 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:19:30,983 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:30,983 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1) = -1*ULTIMATE.start_create_fresh_uint_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_uint_array_~size#1 Supporting invariants [] [2022-07-26 14:19:30,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:31,122 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-26 14:19:31,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:31,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:31,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:19:31,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:31,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:19:31,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:31,167 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:19:31,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 558 transitions. cyclomatic complexity: 456 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:31,212 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 558 transitions. cyclomatic complexity: 456. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 328 states and 1113 transitions. Complement of second has 4 states. [2022-07-26 14:19:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-07-26 14:19:31,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-26 14:19:31,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:31,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-26 14:19:31,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:31,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-26 14:19:31,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:31,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 1113 transitions. [2022-07-26 14:19:31,216 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-26 14:19:31,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 167 states and 560 transitions. [2022-07-26 14:19:31,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2022-07-26 14:19:31,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2022-07-26 14:19:31,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 560 transitions. [2022-07-26 14:19:31,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:31,218 INFO L220 hiAutomatonCegarLoop]: Abstraction has 167 states and 560 transitions. [2022-07-26 14:19:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 560 transitions. [2022-07-26 14:19:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-26 14:19:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 3.3532934131736525) internal successors, (560), 166 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 560 transitions. [2022-07-26 14:19:31,224 INFO L242 hiAutomatonCegarLoop]: Abstraction has 167 states and 560 transitions. [2022-07-26 14:19:31,224 INFO L426 stractBuchiCegarLoop]: Abstraction has 167 states and 560 transitions. [2022-07-26 14:19:31,224 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:19:31,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 560 transitions. [2022-07-26 14:19:31,225 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-26 14:19:31,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:31,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:31,225 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:19:31,225 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:31,226 INFO L733 eck$LassoCheckResult]: Stem: 2779#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2547#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= (select |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45| v_~N~0_92) (= v_~A~0.base_45 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_45) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (store |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_238|) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (= (store |v_#length_186| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_185|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_239|, #length=|v_#length_186|, ~N~0=v_~N~0_92, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_92, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_238|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_185|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2479#[L113-14]don't care [649] L113-14-->L95-3: Formula: (and (= (select |v_#valid_182| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_141| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_107|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (= v_~C~0.offset_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= v_~C~0.base_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_108|, #length=|v_#length_141|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ~C~0.base=v_~C~0.base_29, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_23|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_107|, ~C~0.offset=v_~C~0.offset_29, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ~C~0.base, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 2481#[L95-3]don't care [481] L95-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 2777#[L95-4, thread1ENTRY]don't care [443] thread1ENTRY-->L50-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 2775#[L95-4, L50-5]don't care [2022-07-26 14:19:31,226 INFO L735 eck$LassoCheckResult]: Loop: 2775#[L95-4, L50-5]don't care [637] L50-5-->L50-5: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork0_~i~0_32 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_25))) (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~N~0_58) (= (select |v_#valid_154| v_~A~0.base_25) 1) (= v_~asum~0_23 (+ (select (select |v_#memory_int_97| v_~A~0.base_25) .cse0) v_~asum~0_24)) (<= (+ .cse1 v_~A~0.offset_25 4) (select |v_#length_121| v_~A~0.base_25)) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1)) (<= 0 .cse0)))) InVars {~A~0.base=v_~A~0.base_25, ~A~0.offset=v_~A~0.offset_25, ~asum~0=v_~asum~0_24, #valid=|v_#valid_154|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, #memory_int=|v_#memory_int_97|, #length=|v_#length_121|, ~N~0=v_~N~0_58} OutVars{~A~0.base=v_~A~0.base_25, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_17|, ~A~0.offset=v_~A~0.offset_25, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~asum~0=v_~asum~0_23, #valid=|v_#valid_154|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, #memory_int=|v_#memory_int_97|, #length=|v_#length_121|, ~N~0=v_~N~0_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~post1, ~asum~0, thread1Thread1of1ForFork0_~i~0] 2775#[L95-4, L50-5]don't care [2022-07-26 14:19:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash 673677315, now seen corresponding path program 1 times [2022-07-26 14:19:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:31,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041210850] [2022-07-26 14:19:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash 668, now seen corresponding path program 1 times [2022-07-26 14:19:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:31,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585382213] [2022-07-26 14:19:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash -590839078, now seen corresponding path program 1 times [2022-07-26 14:19:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:31,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663412518] [2022-07-26 14:19:31,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:31,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663412518] [2022-07-26 14:19:31,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663412518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:31,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:31,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:19:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867866747] [2022-07-26 14:19:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:19:31,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:19:31,323 INFO L87 Difference]: Start difference. First operand 167 states and 560 transitions. cyclomatic complexity: 457 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:31,412 INFO L93 Difference]: Finished difference Result 328 states and 1068 transitions. [2022-07-26 14:19:31,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 1068 transitions. [2022-07-26 14:19:31,415 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 238 [2022-07-26 14:19:31,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 324 states and 1056 transitions. [2022-07-26 14:19:31,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2022-07-26 14:19:31,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2022-07-26 14:19:31,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 324 states and 1056 transitions. [2022-07-26 14:19:31,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:31,418 INFO L220 hiAutomatonCegarLoop]: Abstraction has 324 states and 1056 transitions. [2022-07-26 14:19:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states and 1056 transitions. [2022-07-26 14:19:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 248. [2022-07-26 14:19:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 248 states have (on average 3.399193548387097) internal successors, (843), 247 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 843 transitions. [2022-07-26 14:19:31,424 INFO L242 hiAutomatonCegarLoop]: Abstraction has 248 states and 843 transitions. [2022-07-26 14:19:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:19:31,425 INFO L426 stractBuchiCegarLoop]: Abstraction has 248 states and 843 transitions. [2022-07-26 14:19:31,425 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:19:31,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 843 transitions. [2022-07-26 14:19:31,427 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 182 [2022-07-26 14:19:31,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:31,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:31,427 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:31,427 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:31,428 INFO L733 eck$LassoCheckResult]: Stem: 3457#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3225#[L113-6]don't care [641] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_129| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|)) (= (select |v_#valid_162| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) 1) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|) (= (store |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57| (store (select |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|)) |v_#memory_int_99|)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_100|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_99|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_35|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 3227#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= (select |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45| v_~N~0_92) (= v_~A~0.base_45 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_45) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (store |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_238|) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (= (store |v_#length_186| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_185|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_239|, #length=|v_#length_186|, ~N~0=v_~N~0_92, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_92, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_238|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_185|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3229#[L113-14]don't care [636] L113-14-->L113-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0))) (and (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0 4) (select |v_#length_119| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|)) (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|))) (= (select |v_#valid_152| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) 1) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_94|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_93|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_33|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 3159#[L113-14]don't care [649] L113-14-->L95-3: Formula: (and (= (select |v_#valid_182| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_141| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_107|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (= v_~C~0.offset_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= v_~C~0.base_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_108|, #length=|v_#length_141|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ~C~0.base=v_~C~0.base_29, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_23|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_107|, ~C~0.offset=v_~C~0.offset_29, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ~C~0.base, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 3161#[L95-3]don't care [481] L95-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 3595#[L95-4, thread1ENTRY]don't care [443] thread1ENTRY-->L50-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 3597#[L95-4, L50-5]don't care [2022-07-26 14:19:31,428 INFO L735 eck$LassoCheckResult]: Loop: 3597#[L95-4, L50-5]don't care [637] L50-5-->L50-5: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork0_~i~0_32 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_25))) (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~N~0_58) (= (select |v_#valid_154| v_~A~0.base_25) 1) (= v_~asum~0_23 (+ (select (select |v_#memory_int_97| v_~A~0.base_25) .cse0) v_~asum~0_24)) (<= (+ .cse1 v_~A~0.offset_25 4) (select |v_#length_121| v_~A~0.base_25)) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1)) (<= 0 .cse0)))) InVars {~A~0.base=v_~A~0.base_25, ~A~0.offset=v_~A~0.offset_25, ~asum~0=v_~asum~0_24, #valid=|v_#valid_154|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, #memory_int=|v_#memory_int_97|, #length=|v_#length_121|, ~N~0=v_~N~0_58} OutVars{~A~0.base=v_~A~0.base_25, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_17|, ~A~0.offset=v_~A~0.offset_25, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~asum~0=v_~asum~0_23, #valid=|v_#valid_154|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, #memory_int=|v_#memory_int_97|, #length=|v_#length_121|, ~N~0=v_~N~0_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~post1, ~asum~0, thread1Thread1of1ForFork0_~i~0] 3597#[L95-4, L50-5]don't care [2022-07-26 14:19:31,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:31,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2080710644, now seen corresponding path program 1 times [2022-07-26 14:19:31,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:31,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504730807] [2022-07-26 14:19:31,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,450 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 668, now seen corresponding path program 2 times [2022-07-26 14:19:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:31,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917683818] [2022-07-26 14:19:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:31,467 INFO L85 PathProgramCache]: Analyzing trace with hash -77519887, now seen corresponding path program 1 times [2022-07-26 14:19:31,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:31,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598154937] [2022-07-26 14:19:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:31,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:31,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:33,291 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:33,292 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:33,292 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:33,292 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:33,292 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:33,292 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:33,292 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:33,292 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:33,292 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-array-sum.wvr.c_BEv2_Iteration5_Lasso [2022-07-26 14:19:33,292 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:33,292 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:33,295 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,308 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,309 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,310 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,312 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,313 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,316 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,318 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,320 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,321 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,323 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,324 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,325 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,326 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,328 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,329 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,330 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,332 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,333 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,335 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,336 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,338 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,339 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,340 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,342 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,343 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,345 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,994 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,996 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,997 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,998 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:33,999 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:34,000 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:34,002 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:34,003 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:34,004 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:34,005 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:34,516 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:34,516 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:34,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,517 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-26 14:19:34,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:34,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:34,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:34,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:34,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,543 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-26 14:19:34,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:34,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:34,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:34,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,572 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-26 14:19:34,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,574 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-26 14:19:34,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:34,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:34,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:34,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,611 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-26 14:19:34,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,613 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-26 14:19:34,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:34,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:34,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-26 14:19:34,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,653 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-26 14:19:34,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:34,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:34,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,724 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-26 14:19:34,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,726 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,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-26 14:19:34,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:34,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:34,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:34,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,766 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-26 14:19:34,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:34,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:34,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:34,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,815 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-26 14:19:34,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:34,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:34,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:34,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-26 14:19:34,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,854 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-26 14:19:34,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:34,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:34,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:34,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-26 14:19:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,893 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-26 14:19:34,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-26 14:19:34,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:34,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:34,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:34,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,923 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-26 14:19:34,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,924 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-26 14:19:34,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:34,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:34,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-26 14:19:34,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,964 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-26 14:19:34,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:34,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:34,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:34,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:34,987 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-26 14:19:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:34,989 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:34,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-26 14:19:34,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:34,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:34,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:34,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:34,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:34,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:34,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:34,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:35,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,028 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-26 14:19:35,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:35,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:35,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,067 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-26 14:19:35,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:35,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:35,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,107 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-26 14:19:35,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:35,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:35,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:35,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,146 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-26 14:19:35,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:35,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:35,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-26 14:19:35,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,186 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-26 14:19:35,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:35,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:35,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:35,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,210 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-26 14:19:35,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:35,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:35,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-26 14:19:35,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,241 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-26 14:19:35,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:35,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:35,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,267 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-26 14:19:35,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:35,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:35,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:35,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,307 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-26 14:19:35,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:35,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:35,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:35,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,332 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-26 14:19:35,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:35,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:35,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:35,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-26 14:19:35,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,356 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-26 14:19:35,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:35,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:35,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,387 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-26 14:19:35,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:35,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:35,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:35,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-26 14:19:35,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,415 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-26 14:19:35,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:35,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:35,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:35,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:35,453 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-26 14:19:35,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,454 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-26 14:19:35,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:35,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:35,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:35,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:35,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:35,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:35,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:35,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:35,510 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-26 14:19:35,510 INFO L444 ModelExtractionUtils]: 6 out of 40 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-07-26 14:19:35,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:35,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:35,511 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:35,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-26 14:19:35,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:35,531 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:19:35,531 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:35,531 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_~i~0, ~N~0) = -1*thread1Thread1of1ForFork0_~i~0 + 1*~N~0 Supporting invariants [] [2022-07-26 14:19:35,546 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-26 14:19:35,667 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2022-07-26 14:19:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:35,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:19:35,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:35,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:19:35,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:35,716 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:19:35,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 248 states and 843 transitions. cyclomatic complexity: 683 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:35,766 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 248 states and 843 transitions. cyclomatic complexity: 683. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 643 states and 2678 transitions. Complement of second has 4 states. [2022-07-26 14:19:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-07-26 14:19:35,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-26 14:19:35,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:35,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-26 14:19:35,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:35,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-26 14:19:35,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:35,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 643 states and 2678 transitions. [2022-07-26 14:19:35,773 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 168 [2022-07-26 14:19:35,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 643 states to 516 states and 2018 transitions. [2022-07-26 14:19:35,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2022-07-26 14:19:35,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 435 [2022-07-26 14:19:35,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 516 states and 2018 transitions. [2022-07-26 14:19:35,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:35,778 INFO L220 hiAutomatonCegarLoop]: Abstraction has 516 states and 2018 transitions. [2022-07-26 14:19:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states and 2018 transitions. [2022-07-26 14:19:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 323. [2022-07-26 14:19:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 323 states have (on average 4.182662538699691) internal successors, (1351), 322 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 1351 transitions. [2022-07-26 14:19:35,784 INFO L242 hiAutomatonCegarLoop]: Abstraction has 323 states and 1351 transitions. [2022-07-26 14:19:35,784 INFO L426 stractBuchiCegarLoop]: Abstraction has 323 states and 1351 transitions. [2022-07-26 14:19:35,784 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:19:35,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 1351 transitions. [2022-07-26 14:19:35,786 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 140 [2022-07-26 14:19:35,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:35,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:35,787 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:35,787 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:35,787 INFO L733 eck$LassoCheckResult]: Stem: 4950#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4568#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= (select |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45| v_~N~0_92) (= v_~A~0.base_45 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_45) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (store |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_238|) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (= (store |v_#length_186| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_185|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_239|, #length=|v_#length_186|, ~N~0=v_~N~0_92, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_92, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_238|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_185|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4492#[L113-14]don't care [649] L113-14-->L95-3: Formula: (and (= (select |v_#valid_182| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_141| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_107|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (= v_~C~0.offset_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= v_~C~0.base_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_108|, #length=|v_#length_141|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ~C~0.base=v_~C~0.base_29, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_23|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_107|, ~C~0.offset=v_~C~0.offset_29, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ~C~0.base, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 4494#[L95-3]don't care [481] L95-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 4948#[L95-4, thread1ENTRY]don't care [635] L95-4-->L96-3: Formula: (and (= (select |v_#valid_150| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_35|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_117| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_#memory_int_89| (store |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre12#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_90|, #length=|v_#length_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_150|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_89|, #length=|v_#length_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 4608#[L96-3, thread1ENTRY]don't care [484] L96-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_16, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_8|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~mem4, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4610#[L96-4, thread2ENTRY, thread1ENTRY]don't care [455] thread2ENTRY-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] 4720#[L96-4, L58-4, thread1ENTRY]don't care [2022-07-26 14:19:35,787 INFO L735 eck$LassoCheckResult]: Loop: 4720#[L96-4, L58-4, thread1ENTRY]don't care [502] L58-4-->L61: Formula: (let ((.cse1 (* v_thread2Thread1of1ForFork1_~i~1_19 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_7)) (.cse2 (+ .cse1 v_~C~0.offset_15))) (and (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_7 4) (select |v_#length_41| v_~A~0.base_7)) (= (select |v_#valid_48| v_~C~0.base_15) 1) (<= (+ .cse1 v_~C~0.offset_15 4) (select |v_#length_41| v_~C~0.base_15)) (= (store |v_#memory_int_40| v_~C~0.base_15 (store (select |v_#memory_int_40| v_~C~0.base_15) .cse2 (+ 1 (select (select |v_#memory_int_40| v_~A~0.base_7) .cse0)))) |v_#memory_int_39|) (< v_thread2Thread1of1ForFork1_~i~1_19 v_~N~0_16) (<= 0 .cse2) (= (select |v_#valid_48| v_~A~0.base_7) 1)))) InVars {~A~0.base=v_~A~0.base_7, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_19, ~A~0.offset=v_~A~0.offset_7, ~C~0.base=v_~C~0.base_15, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_40|, ~C~0.offset=v_~C~0.offset_15, #length=|v_#length_41|, ~N~0=v_~N~0_16} OutVars{~A~0.base=v_~A~0.base_7, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_19, ~A~0.offset=v_~A~0.offset_7, ~C~0.base=v_~C~0.base_15, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_39|, ~C~0.offset=v_~C~0.offset_15, #length=|v_#length_41|, ~N~0=v_~N~0_16, thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_5|} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork1_#t~mem4] 4898#[L96-4, L61, thread1ENTRY]don't care [589] L61-->L58-4: Formula: (and (= v_~p~0_12 v_thread2Thread1of1ForFork1_~i~1_26) (= v_thread2Thread1of1ForFork1_~i~1_25 (+ v_thread2Thread1of1ForFork1_~i~1_26 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_26} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_25, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_15|, ~p~0=v_~p~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, ~p~0] 4720#[L96-4, L58-4, thread1ENTRY]don't care [2022-07-26 14:19:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1135962010, now seen corresponding path program 1 times [2022-07-26 14:19:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:35,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381108257] [2022-07-26 14:19:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:35,799 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:35,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 17112, now seen corresponding path program 1 times [2022-07-26 14:19:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:35,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513232374] [2022-07-26 14:19:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:35,810 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:35,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash -737782275, now seen corresponding path program 1 times [2022-07-26 14:19:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:35,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742197288] [2022-07-26 14:19:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:35,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:35,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742197288] [2022-07-26 14:19:35,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742197288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:35,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:35,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 14:19:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454261855] [2022-07-26 14:19:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:19:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:19:35,903 INFO L87 Difference]: Start difference. First operand 323 states and 1351 transitions. cyclomatic complexity: 1114 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:35,978 INFO L93 Difference]: Finished difference Result 400 states and 1541 transitions. [2022-07-26 14:19:35,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 1541 transitions. [2022-07-26 14:19:35,981 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 164 [2022-07-26 14:19:35,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 384 states and 1499 transitions. [2022-07-26 14:19:35,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2022-07-26 14:19:35,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2022-07-26 14:19:35,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 384 states and 1499 transitions. [2022-07-26 14:19:35,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:35,984 INFO L220 hiAutomatonCegarLoop]: Abstraction has 384 states and 1499 transitions. [2022-07-26 14:19:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states and 1499 transitions. [2022-07-26 14:19:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 356. [2022-07-26 14:19:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 356 states have (on average 4.036516853932584) internal successors, (1437), 355 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1437 transitions. [2022-07-26 14:19:35,991 INFO L242 hiAutomatonCegarLoop]: Abstraction has 356 states and 1437 transitions. [2022-07-26 14:19:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:19:35,992 INFO L426 stractBuchiCegarLoop]: Abstraction has 356 states and 1437 transitions. [2022-07-26 14:19:35,992 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 14:19:35,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 356 states and 1437 transitions. [2022-07-26 14:19:35,994 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 148 [2022-07-26 14:19:35,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:35,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:35,994 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:35,994 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:35,994 INFO L733 eck$LassoCheckResult]: Stem: 6072#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5622#[L113-6]don't care [641] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_129| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|)) (= (select |v_#valid_162| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) 1) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|) (= (store |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57| (store (select |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|)) |v_#memory_int_99|)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_100|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_99|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_35|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 5624#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= (select |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45| v_~N~0_92) (= v_~A~0.base_45 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_45) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (store |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_238|) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (= (store |v_#length_186| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_185|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_239|, #length=|v_#length_186|, ~N~0=v_~N~0_92, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_92, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_238|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_185|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5626#[L113-14]don't care [636] L113-14-->L113-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0))) (and (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0 4) (select |v_#length_119| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|)) (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|))) (= (select |v_#valid_152| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) 1) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_94|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_93|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_33|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 5554#[L113-14]don't care [649] L113-14-->L95-3: Formula: (and (= (select |v_#valid_182| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_141| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_107|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (= v_~C~0.offset_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= v_~C~0.base_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_108|, #length=|v_#length_141|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ~C~0.base=v_~C~0.base_29, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_23|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_107|, ~C~0.offset=v_~C~0.offset_29, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ~C~0.base, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 5556#[L95-3]don't care [481] L95-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 6146#[L95-4, thread1ENTRY]don't care [635] L95-4-->L96-3: Formula: (and (= (select |v_#valid_150| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_35|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_117| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_#memory_int_89| (store |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre12#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_90|, #length=|v_#length_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_150|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_89|, #length=|v_#length_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 6148#[L96-3, thread1ENTRY]don't care [484] L96-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_16, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_8|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~mem4, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 6154#[L96-4, thread2ENTRY, thread1ENTRY]don't care [455] thread2ENTRY-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] 6062#[L96-4, L58-4, thread1ENTRY]don't care [2022-07-26 14:19:35,995 INFO L735 eck$LassoCheckResult]: Loop: 6062#[L96-4, L58-4, thread1ENTRY]don't care [502] L58-4-->L61: Formula: (let ((.cse1 (* v_thread2Thread1of1ForFork1_~i~1_19 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_7)) (.cse2 (+ .cse1 v_~C~0.offset_15))) (and (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_7 4) (select |v_#length_41| v_~A~0.base_7)) (= (select |v_#valid_48| v_~C~0.base_15) 1) (<= (+ .cse1 v_~C~0.offset_15 4) (select |v_#length_41| v_~C~0.base_15)) (= (store |v_#memory_int_40| v_~C~0.base_15 (store (select |v_#memory_int_40| v_~C~0.base_15) .cse2 (+ 1 (select (select |v_#memory_int_40| v_~A~0.base_7) .cse0)))) |v_#memory_int_39|) (< v_thread2Thread1of1ForFork1_~i~1_19 v_~N~0_16) (<= 0 .cse2) (= (select |v_#valid_48| v_~A~0.base_7) 1)))) InVars {~A~0.base=v_~A~0.base_7, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_19, ~A~0.offset=v_~A~0.offset_7, ~C~0.base=v_~C~0.base_15, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_40|, ~C~0.offset=v_~C~0.offset_15, #length=|v_#length_41|, ~N~0=v_~N~0_16} OutVars{~A~0.base=v_~A~0.base_7, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_19, ~A~0.offset=v_~A~0.offset_7, ~C~0.base=v_~C~0.base_15, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_39|, ~C~0.offset=v_~C~0.offset_15, #length=|v_#length_41|, ~N~0=v_~N~0_16, thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_5|} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork1_#t~mem4] 6058#[L96-4, L61, thread1ENTRY]don't care [589] L61-->L58-4: Formula: (and (= v_~p~0_12 v_thread2Thread1of1ForFork1_~i~1_26) (= v_thread2Thread1of1ForFork1_~i~1_25 (+ v_thread2Thread1of1ForFork1_~i~1_26 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_26} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_25, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_15|, ~p~0=v_~p~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, ~p~0] 6062#[L96-4, L58-4, thread1ENTRY]don't care [2022-07-26 14:19:35,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1892031023, now seen corresponding path program 1 times [2022-07-26 14:19:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:35,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766023989] [2022-07-26 14:19:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:36,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:36,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash 17112, now seen corresponding path program 2 times [2022-07-26 14:19:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:36,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361397386] [2022-07-26 14:19:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:36,081 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:36,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:36,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1470663046, now seen corresponding path program 1 times [2022-07-26 14:19:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:36,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660355254] [2022-07-26 14:19:36,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:36,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:36,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:36,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:38,571 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:38,571 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:38,571 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:38,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:38,572 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:38,572 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:38,572 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:38,572 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:38,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-array-sum.wvr.c_BEv2_Iteration7_Lasso [2022-07-26 14:19:38,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:38,572 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:38,574 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:38,575 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:38,577 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:38,578 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:38,579 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:38,581 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:38,582 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:38,583 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:38,585 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,573 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,579 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,581 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,582 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,588 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,590 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,592 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,593 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,595 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,597 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,598 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,599 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,601 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,602 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,604 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,605 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,607 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,608 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,610 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,611 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,612 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,613 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,615 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,617 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,619 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,620 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,621 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,623 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,624 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,625 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,627 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,628 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,629 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:39,631 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:19:40,258 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:40,258 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:40,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,259 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-26 14:19:40,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:40,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:40,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:40,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,293 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-26 14:19:40,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:40,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:40,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:40,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,317 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-26 14:19:40,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:40,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:40,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:40,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,346 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-26 14:19:40,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,377 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-26 14:19:40,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,415 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-26 14:19:40,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,417 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:40,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:40,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:40,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-26 14:19:40,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-26 14:19:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,453 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-26 14:19:40,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-07-26 14:19:40,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,499 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-26 14:19:40,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,536 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-26 14:19:40,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,537 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-26 14:19:40,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,577 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-26 14:19:40,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,623 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-26 14:19:40,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-26 14:19:40,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,663 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-26 14:19:40,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,664 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-26 14:19:40,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,703 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-26 14:19:40,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,705 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-26 14:19:40,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,745 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-26 14:19:40,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,776 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-26 14:19:40,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,816 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-26 14:19:40,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,846 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-26 14:19:40,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:40,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,884 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-26 14:19:40,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-26 14:19:40,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,913 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-26 14:19:40,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-26 14:19:40,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,944 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-26 14:19:40,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:40,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:40,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-26 14:19:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:40,977 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:40,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-26 14:19:40,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:40,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:40,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:40,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:40,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:40,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:40,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:41,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:41,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:41,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:41,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:41,017 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:41,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-26 14:19:41,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:41,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:41,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:41,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:41,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:41,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:41,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:41,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:41,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:41,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:41,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:41,059 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:41,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-26 14:19:41,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:41,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:41,066 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-26 14:19:41,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:41,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:41,071 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-26 14:19:41,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:41,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:41,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:41,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:41,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:41,111 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:41,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:41,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:41,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:41,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:41,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:41,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:41,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:41,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-26 14:19:41,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:41,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-26 14:19:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:41,162 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:41,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-26 14:19:41,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:41,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:41,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:41,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:41,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:41,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:41,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:41,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:41,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:41,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:41,214 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:41,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-26 14:19:41,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:41,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:41,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:41,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:41,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:41,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:41,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:41,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:41,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:41,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:41,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:41,267 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:41,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-26 14:19:41,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:19:41,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:41,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:41,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:41,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:41,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:41,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:41,299 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:41,323 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-26 14:19:41,323 INFO L444 ModelExtractionUtils]: 14 out of 49 variables were initially zero. Simplification set additionally 32 variables to zero. [2022-07-26 14:19:41,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:41,324 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:41,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-26 14:19:41,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:41,347 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:19:41,347 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:41,347 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread2Thread1of1ForFork1_~i~1) = 1*~N~0 - 1*thread2Thread1of1ForFork1_~i~1 Supporting invariants [] [2022-07-26 14:19:41,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:41,484 INFO L156 tatePredicateManager]: 46 out of 46 supporting invariants were superfluous and have been removed [2022-07-26 14:19:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:41,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:19:41,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:41,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:19:41,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:41,544 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-26 14:19:41,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 356 states and 1437 transitions. cyclomatic complexity: 1173 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:41,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 356 states and 1437 transitions. cyclomatic complexity: 1173. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 999 states and 4435 transitions. Complement of second has 6 states. [2022-07-26 14:19:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-07-26 14:19:41,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 14:19:41,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:41,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:19:41,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:41,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-26 14:19:41,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:41,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 999 states and 4435 transitions. [2022-07-26 14:19:41,635 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 104 [2022-07-26 14:19:41,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 999 states to 740 states and 3190 transitions. [2022-07-26 14:19:41,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2022-07-26 14:19:41,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 451 [2022-07-26 14:19:41,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 740 states and 3190 transitions. [2022-07-26 14:19:41,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:41,643 INFO L220 hiAutomatonCegarLoop]: Abstraction has 740 states and 3190 transitions. [2022-07-26 14:19:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states and 3190 transitions. [2022-07-26 14:19:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 537. [2022-07-26 14:19:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 537 states have (on average 4.454376163873371) internal successors, (2392), 536 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 2392 transitions. [2022-07-26 14:19:41,654 INFO L242 hiAutomatonCegarLoop]: Abstraction has 537 states and 2392 transitions. [2022-07-26 14:19:41,654 INFO L426 stractBuchiCegarLoop]: Abstraction has 537 states and 2392 transitions. [2022-07-26 14:19:41,654 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-26 14:19:41,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 537 states and 2392 transitions. [2022-07-26 14:19:41,657 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 104 [2022-07-26 14:19:41,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:41,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:41,657 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:41,657 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:41,658 INFO L733 eck$LassoCheckResult]: Stem: 8094#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7592#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= (select |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45| v_~N~0_92) (= v_~A~0.base_45 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_45) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (store |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_238|) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (= (store |v_#length_186| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_185|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_239|, #length=|v_#length_186|, ~N~0=v_~N~0_92, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_92, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_238|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_185|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7498#[L113-14]don't care [649] L113-14-->L95-3: Formula: (and (= (select |v_#valid_182| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_141| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_107|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (= v_~C~0.offset_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= v_~C~0.base_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_108|, #length=|v_#length_141|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ~C~0.base=v_~C~0.base_29, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_23|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_107|, ~C~0.offset=v_~C~0.offset_29, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ~C~0.base, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 7500#[L95-3]don't care [481] L95-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 8092#[L95-4, thread1ENTRY]don't care [635] L95-4-->L96-3: Formula: (and (= (select |v_#valid_150| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_35|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_117| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_#memory_int_89| (store |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre12#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_90|, #length=|v_#length_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_150|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_89|, #length=|v_#length_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 7646#[L96-3, thread1ENTRY]don't care [484] L96-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_16, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_8|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~mem4, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 7648#[L96-4, thread2ENTRY, thread1ENTRY]don't care [647] L96-4-->L97-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_23|) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t3~0#1.base_29|)) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t3~0#1.base_29| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t3~0#1.base_29|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_19|)) |v_#memory_int_103|) (= (select |v_#valid_174| |v_ULTIMATE.start_main_~#t3~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre14#1_19| |v_#pthreadsForks_39|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_29|, #length=|v_#length_133|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_19|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_29|, #length=|v_#length_133|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 7758#[thread2ENTRY, thread1ENTRY, L97-3]don't care [487] L97-3-->thread3ENTRY: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar3_2) (= 0 v_thread3Thread1of1ForFork2_thidvar2_2) (= 0 v_thread3Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre14#1_6| v_thread3Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_2, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_4|, thread3Thread1of1ForFork2_~cond~0=v_thread3Thread1of1ForFork2_~cond~0_8, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_4|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_8|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_16, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar3, thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_~cond~0, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2, thread3Thread1of1ForFork2_#t~mem5] 7876#[thread3ENTRY, thread1ENTRY, thread2ENTRY, L97-4]don't care [466] thread3ENTRY-->L76-1: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] 7508#[thread1ENTRY, thread2ENTRY, L97-4, L76-1]don't care [2022-07-26 14:19:41,658 INFO L735 eck$LassoCheckResult]: Loop: 7508#[thread1ENTRY, thread2ENTRY, L97-4, L76-1]don't care [612] L76-1-->L76-1: Formula: (and (= (mod v_thread3Thread1of1ForFork2_~cond~0_13 256) 0) (< v_thread3Thread1of1ForFork2_~i~2_33 v_~N~0_44) (= v_thread3Thread1of1ForFork2_~cond~0_13 (ite (= (ite (< v_thread3Thread1of1ForFork2_~i~2_33 v_~p~0_16) 1 0) 0) 0 1))) InVars {~p~0=v_~p~0_16, ~N~0=v_~N~0_44, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33} OutVars{~p~0=v_~p~0_16, thread3Thread1of1ForFork2_~cond~0=v_thread3Thread1of1ForFork2_~cond~0_13, ~N~0=v_~N~0_44, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~0] 7508#[thread1ENTRY, thread2ENTRY, L97-4, L76-1]don't care [2022-07-26 14:19:41,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash -737598351, now seen corresponding path program 1 times [2022-07-26 14:19:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:41,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736503065] [2022-07-26 14:19:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash 643, now seen corresponding path program 1 times [2022-07-26 14:19:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:41,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283321166] [2022-07-26 14:19:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,704 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1390711789, now seen corresponding path program 1 times [2022-07-26 14:19:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:41,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900399068] [2022-07-26 14:19:41,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:41,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:19:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:41,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900399068] [2022-07-26 14:19:41,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900399068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:41,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:41,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:19:41,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938783301] [2022-07-26 14:19:41,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:41,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:19:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:19:41,758 INFO L87 Difference]: Start difference. First operand 537 states and 2392 transitions. cyclomatic complexity: 1969 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:41,835 INFO L93 Difference]: Finished difference Result 539 states and 2331 transitions. [2022-07-26 14:19:41,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 2331 transitions. [2022-07-26 14:19:41,840 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 68 [2022-07-26 14:19:41,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 461 states and 2159 transitions. [2022-07-26 14:19:41,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2022-07-26 14:19:41,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2022-07-26 14:19:41,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 2159 transitions. [2022-07-26 14:19:41,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:41,844 INFO L220 hiAutomatonCegarLoop]: Abstraction has 461 states and 2159 transitions. [2022-07-26 14:19:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 2159 transitions. [2022-07-26 14:19:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2022-07-26 14:19:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 461 states have (on average 4.683297180043384) internal successors, (2159), 460 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 2159 transitions. [2022-07-26 14:19:41,852 INFO L242 hiAutomatonCegarLoop]: Abstraction has 461 states and 2159 transitions. [2022-07-26 14:19:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:19:41,855 INFO L426 stractBuchiCegarLoop]: Abstraction has 461 states and 2159 transitions. [2022-07-26 14:19:41,855 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-26 14:19:41,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 461 states and 2159 transitions. [2022-07-26 14:19:41,889 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 68 [2022-07-26 14:19:41,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:41,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:41,889 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:41,889 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:19:41,890 INFO L733 eck$LassoCheckResult]: Stem: 9813#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#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_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_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_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 9217#[L113-6]don't care [641] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_129| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|)) (= (select |v_#valid_162| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) 1) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|) (= (store |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57| (store (select |v_#memory_int_100| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|)) |v_#memory_int_99|)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_100|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_162|, #memory_int=|v_#memory_int_99|, #length=|v_#length_129|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_35|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 9219#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= (select |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45| v_~N~0_92) (= v_~A~0.base_45 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_45) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (store |v_#valid_239| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_238|) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (= (store |v_#length_186| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_185|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_239|, #length=|v_#length_186|, ~N~0=v_~N~0_92, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_92, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_238|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_185|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 9127#[L113-14]don't care [636] L113-14-->L113-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0))) (and (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse0 4) (select |v_#length_119| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|)) (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|))) (= (select |v_#valid_152| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) 1) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_94|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_93|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_33|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 9129#[L113-14]don't care [649] L113-14-->L95-3: Formula: (and (= (select |v_#valid_182| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_141| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_107|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (= v_~C~0.offset_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= v_~C~0.base_29 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_108|, #length=|v_#length_141|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ~C~0.base=v_~C~0.base_29, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_23|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_182|, #memory_int=|v_#memory_int_107|, ~C~0.offset=v_~C~0.offset_29, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ~C~0.base, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 9131#[L95-3]don't care [481] L95-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 9803#[L95-4, thread1ENTRY]don't care [635] L95-4-->L96-3: Formula: (and (= (select |v_#valid_150| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_35|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_117| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_#memory_int_89| (store |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre12#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_90|, #length=|v_#length_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_150|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_89|, #length=|v_#length_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 9281#[L96-3, thread1ENTRY]don't care [484] L96-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_16, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_8|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~mem4, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 9283#[L96-4, thread2ENTRY, thread1ENTRY]don't care [647] L96-4-->L97-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_23|) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_23| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t3~0#1.base_29|)) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t3~0#1.base_29| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t3~0#1.base_29|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_19|)) |v_#memory_int_103|) (= (select |v_#valid_174| |v_ULTIMATE.start_main_~#t3~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre14#1_19| |v_#pthreadsForks_39|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_29|, #length=|v_#length_133|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_19|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_29|, #length=|v_#length_133|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 9397#[thread2ENTRY, thread1ENTRY, L97-3]don't care [487] L97-3-->thread3ENTRY: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar3_2) (= 0 v_thread3Thread1of1ForFork2_thidvar2_2) (= 0 v_thread3Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre14#1_6| v_thread3Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_2, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_4|, thread3Thread1of1ForFork2_~cond~0=v_thread3Thread1of1ForFork2_~cond~0_8, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_4|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_8|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_16, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar3, thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_~cond~0, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2, thread3Thread1of1ForFork2_#t~mem5] 9535#[thread3ENTRY, thread1ENTRY, thread2ENTRY, L97-4]don't care [466] thread3ENTRY-->L76-1: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] 9119#[thread1ENTRY, thread2ENTRY, L97-4, L76-1]don't care [2022-07-26 14:19:41,890 INFO L735 eck$LassoCheckResult]: Loop: 9119#[thread1ENTRY, thread2ENTRY, L97-4, L76-1]don't care [612] L76-1-->L76-1: Formula: (and (= (mod v_thread3Thread1of1ForFork2_~cond~0_13 256) 0) (< v_thread3Thread1of1ForFork2_~i~2_33 v_~N~0_44) (= v_thread3Thread1of1ForFork2_~cond~0_13 (ite (= (ite (< v_thread3Thread1of1ForFork2_~i~2_33 v_~p~0_16) 1 0) 0) 0 1))) InVars {~p~0=v_~p~0_16, ~N~0=v_~N~0_44, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33} OutVars{~p~0=v_~p~0_16, thread3Thread1of1ForFork2_~cond~0=v_thread3Thread1of1ForFork2_~cond~0_13, ~N~0=v_~N~0_44, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~0] 9119#[thread1ENTRY, thread2ENTRY, L97-4, L76-1]don't care [2022-07-26 14:19:41,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1470846970, now seen corresponding path program 1 times [2022-07-26 14:19:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:41,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688131004] [2022-07-26 14:19:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,926 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:41,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash 643, now seen corresponding path program 2 times [2022-07-26 14:19:41,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:41,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760907419] [2022-07-26 14:19:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:41,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:41,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1648383574, now seen corresponding path program 1 times [2022-07-26 14:19:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:41,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323953700] [2022-07-26 14:19:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:41,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:42,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:44,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:19:44 BoogieIcfgContainer [2022-07-26 14:19:44,606 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:19:44,609 INFO L158 Benchmark]: Toolchain (without parser) took 25008.77ms. Allocated memory was 245.4MB in the beginning and 505.4MB in the end (delta: 260.0MB). Free memory was 190.0MB in the beginning and 281.4MB in the end (delta: -91.4MB). Peak memory consumption was 169.7MB. Max. memory is 8.0GB. [2022-07-26 14:19:44,609 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 245.4MB. Free memory is still 206.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:19:44,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.63ms. Allocated memory was 245.4MB in the beginning and 350.2MB in the end (delta: 104.9MB). Free memory was 189.7MB in the beginning and 321.9MB in the end (delta: -132.2MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2022-07-26 14:19:44,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.02ms. Allocated memory is still 350.2MB. Free memory was 321.7MB in the beginning and 319.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:19:44,610 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 350.2MB. Free memory was 319.8MB in the beginning and 318.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:19:44,610 INFO L158 Benchmark]: RCFGBuilder took 493.68ms. Allocated memory is still 350.2MB. Free memory was 318.1MB in the beginning and 299.9MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-07-26 14:19:44,610 INFO L158 Benchmark]: BuchiAutomizer took 24248.58ms. Allocated memory was 350.2MB in the beginning and 505.4MB in the end (delta: 155.2MB). Free memory was 299.7MB in the beginning and 281.4MB in the end (delta: 18.3MB). Peak memory consumption was 174.5MB. Max. memory is 8.0GB. [2022-07-26 14:19:44,611 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.10ms. Allocated memory is still 245.4MB. Free memory is still 206.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.63ms. Allocated memory was 245.4MB in the beginning and 350.2MB in the end (delta: 104.9MB). Free memory was 189.7MB in the beginning and 321.9MB in the end (delta: -132.2MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.02ms. Allocated memory is still 350.2MB. Free memory was 321.7MB in the beginning and 319.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 350.2MB. Free memory was 319.8MB in the beginning and 318.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 493.68ms. Allocated memory is still 350.2MB. Free memory was 318.1MB in the beginning and 299.9MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 24248.58ms. Allocated memory was 350.2MB in the beginning and 505.4MB in the end (delta: 155.2MB). Free memory was 299.7MB in the beginning and 281.4MB in the end (delta: 18.3MB). Peak memory consumption was 174.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[arr] and consists of 2 locations. One deterministic module has affine ranking function size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 461 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.0s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 18.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 824 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 328 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 548 IncrementalHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 33 mSDtfsCounter, 548 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital358 mio100 ax111 hnf100 lsp80 ukn67 mio100 lsp42 div118 bol100 ite100 ukn100 eq172 hnf92 smp85 dnf102 smp98 tf100 neg99 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 8 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 4.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 72]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\old(cond)=1, \old(size)=1, \result={0:0}, \result=0, \result={-2:0}, \result={0:0}, \result={0:0}, A={-1:0}, arr={-2:0}, asum=0, C={-2:0}, cond=1, cond=0, csum=0, i=1, i=0, i=0, i=0, N=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@177779c5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@40457b60=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@68ffd0b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10eaee6b in0,26027, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@223121c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f30878d={0:0}, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e571835={0:0}, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56de9b09={0:0}, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b63d54d in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e5c246d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f8dab05 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@40ab1e22=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@49eebd99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6e20b7bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@143d499=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1f796d39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@245e6306=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@b421b9e=0, p=0, size=1, t1={15662:0}, t2={15661:0}, t3={29961:0}} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 72]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L42] 0 unsigned int* A; [L43] 0 unsigned int* C; [L44] 0 unsigned int asum, csum; [L45] 0 int p, N; [L88] 0 pthread_t t1, t2, t3; [L90] 0 N = __VERIFIER_nondet_int() [L91] CALL, EXPR 0 create_fresh_uint_array(N) [L109] CALL 0 assume_abort_if_not(size >= 0) [L39] COND TRUE 0 !cond [L109] RET 0 assume_abort_if_not(size >= 0) [L110] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(unsigned int))) [L39] COND FALSE 0 !(!cond) [L110] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(unsigned int))) [L112] 0 unsigned int* arr = (unsigned int*)malloc(sizeof(unsigned int) * (size_t)size); [L113] 0 int i = 0; [L113] COND TRUE 0 i < size [L114] 0 arr[i] = __VERIFIER_nondet_uint() [L113] 0 i++ [L113] COND FALSE 0 !(i < size) [L116] 0 return arr; [L91] RET, EXPR 0 create_fresh_uint_array(N) [L91] 0 A = create_fresh_uint_array(N) [L92] CALL, EXPR 0 create_fresh_uint_array(N) [L109] CALL 0 assume_abort_if_not(size >= 0) [L39] COND FALSE 0 !(!cond) [L109] RET 0 assume_abort_if_not(size >= 0) [L110] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(unsigned int))) [L39] COND TRUE 0 !cond [L110] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(unsigned int))) [L112] 0 unsigned int* arr = (unsigned int*)malloc(sizeof(unsigned int) * (size_t)size); [L113] 0 int i = 0; [L113] COND TRUE 0 i < size [L114] 0 arr[i] = __VERIFIER_nondet_uint() [L113] 0 i++ [L116] 0 return arr; [L92] RET, EXPR 0 create_fresh_uint_array(N) [L92] 0 C = create_fresh_uint_array(N) [L95] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) [L96] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) [L97] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) [L71] 3 int i = 0; Loop: [L72] COND TRUE i < N [L74] _Bool cond = i < p; [L76] COND FALSE !(\read(cond)) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 175 PlacesBefore, 33 PlacesAfterwards, 181 TransitionsBefore, 29 TransitionsAfterwards, 1720 CoEnabledTransitionPairs, 7 FixpointIterations, 111 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 6 ConcurrentYvCompositions, 10 ChoiceCompositions, 186 TotalNumberOfCompositions, 2482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2059, positive: 1997, positive conditional: 0, positive unconditional: 1997, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 974, positive: 955, positive conditional: 0, positive unconditional: 955, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2059, positive: 1042, positive conditional: 0, positive unconditional: 1042, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 974, unknown conditional: 0, unknown unconditional: 974] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 14:19:44,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...