/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-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:24:17,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:24:17,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:24:17,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:24:17,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:24:17,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:24:17,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:24:17,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:24:17,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:24:17,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:24:17,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:24:17,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:24:17,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:24:17,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:24:17,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:24:17,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:24:17,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:24:17,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:24:17,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:24:17,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:24:17,949 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:24:17,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:24:17,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:24:17,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:24:17,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:24:17,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:24:17,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:24:17,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:24:17,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:24:17,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:24:17,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:24:17,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:24:17,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:24:17,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:24:17,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:24:17,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:24:17,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:24:17,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:24:17,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:24:17,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:24:17,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:24:17,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:24:17,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:24:18,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:24:18,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:24:18,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:24:18,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:24:18,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:24:18,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:24:18,052 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:24:18,052 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:24:18,052 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:24:18,054 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:24:18,054 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:24:18,054 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:24:18,054 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:24:18,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:24:18,055 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:24:18,055 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:24:18,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:24:18,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:24:18,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:24:18,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:24:18,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:24:18,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:24:18,057 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:24:18,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:24:18,057 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:24:18,057 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:24:18,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:24:18,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:24:18,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:24:18,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:24:18,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:24:18,062 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:24:18,063 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:24:18,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:24:18,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:24:18,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:24:18,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:24:18,562 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:24:18,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-07-22 12:24:18,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb5fdc23f/bb511666f9b24e73a4d5f57b053c3d08/FLAGd06aa13bd [2022-07-22 12:24:19,332 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:24:19,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-07-22 12:24:19,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb5fdc23f/bb511666f9b24e73a4d5f57b053c3d08/FLAGd06aa13bd [2022-07-22 12:24:19,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb5fdc23f/bb511666f9b24e73a4d5f57b053c3d08 [2022-07-22 12:24:19,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:24:19,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:24:19,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:24:19,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:24:19,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:24:19,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50683e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19, skipping insertion in model container [2022-07-22 12:24:19,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:24:19,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:24:19,892 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-more-sum-array-hom.wvr.c[2396,2409] [2022-07-22 12:24:19,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:24:19,919 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:24:19,980 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-more-sum-array-hom.wvr.c[2396,2409] [2022-07-22 12:24:19,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:24:20,015 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:24:20,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20 WrapperNode [2022-07-22 12:24:20,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:24:20,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:24:20,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:24:20,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:24:20,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,114 INFO L137 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 99 [2022-07-22 12:24:20,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:24:20,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:24:20,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:24:20,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:24:20,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:24:20,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:24:20,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:24:20,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:24:20,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (1/1) ... [2022-07-22 12:24:20,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:20,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:20,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:20,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:24:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:24:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:24:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:24:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:24:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:24:20,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:24:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:24:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:24:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:24:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:24:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:24:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:24:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:24:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:24:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:24:20,331 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:24:20,439 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:24:20,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:24:20,773 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:24:20,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:24:20,785 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:24:20,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:24:20 BoogieIcfgContainer [2022-07-22 12:24:20,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:24:20,790 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:24:20,790 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:24:20,795 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:24:20,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:20,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:24:19" (1/3) ... [2022-07-22 12:24:20,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50250294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:24:20, skipping insertion in model container [2022-07-22 12:24:20,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:20,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:20" (2/3) ... [2022-07-22 12:24:20,798 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50250294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:24:20, skipping insertion in model container [2022-07-22 12:24:20,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:20,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:24:20" (3/3) ... [2022-07-22 12:24:20,801 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-07-22 12:24:20,984 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:24:21,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 159 transitions, 342 flow [2022-07-22 12:24:21,139 INFO L129 PetriNetUnfolder]: 12/153 cut-off events. [2022-07-22 12:24:21,143 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:24:21,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 12/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-07-22 12:24:21,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 159 transitions, 342 flow [2022-07-22 12:24:21,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 153 transitions, 324 flow [2022-07-22 12:24:21,176 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:24:21,204 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 153 transitions, 324 flow [2022-07-22 12:24:21,214 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 153 transitions, 324 flow [2022-07-22 12:24:21,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 324 flow [2022-07-22 12:24:21,291 INFO L129 PetriNetUnfolder]: 12/153 cut-off events. [2022-07-22 12:24:21,292 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:24:21,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 12/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-07-22 12:24:21,298 INFO L116 LiptonReduction]: Number of co-enabled transitions 1728 [2022-07-22 12:24:26,296 INFO L131 LiptonReduction]: Checked pairs total: 1856 [2022-07-22 12:24:26,296 INFO L133 LiptonReduction]: Total number of compositions: 146 [2022-07-22 12:24:26,321 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:24:26,322 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:24:26,322 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:24:26,322 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:24:26,322 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:24:26,322 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:24:26,323 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:24:26,323 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:24:26,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:24:26,391 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:24:26,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:26,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:26,398 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:24:26,399 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:26,399 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:24:26,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 106 states, but on-demand construction may add more states [2022-07-22 12:24:26,410 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:24:26,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:26,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:26,411 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:24:26,411 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:26,418 INFO L748 eck$LassoCheckResult]: Stem: 157#[ULTIMATE.startENTRY]don't care [554] ULTIMATE.startENTRY-->L100-6: Formula: (let ((.cse0 (store |v_#valid_198| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1))) (let ((.cse1 (select |v_#memory_int_149| 1)) (.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_61| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (= (select |v_#valid_198| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= v_~A~0.offset_74 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21| v_~N~0_59) (= 2 (select |v_#length_153| 1)) (= (select |v_#valid_198| 0) 0) (= |v_#NULL.base_12| 0) (= v_~sum1~0_57 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|) 1 0) 0)) (= 32 (select |v_#length_153| 2)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= (select .cse1 1) 0) (= v_~A~0.base_74 0) (= (select |v_#valid_198| 2) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_61|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_53| 0) (= 48 (select .cse1 0)) (= (store (store (store (store |v_#length_153| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_61| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4)) |v_#length_151|) (= (select |v_#valid_198| 1) 1) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46| 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|) (= (store .cse3 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 1) |v_#valid_196|) (< 0 |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_61|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= v_~sum3~0_41 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| |v_#StackHeapBarrier_32|) (= v_~sum2~0_53 0) (= |v_#NULL.offset_12| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_198|, #memory_int=|v_#memory_int_149|, #length=|v_#length_153|} OutVars{~A~0.base=v_~A~0.base_74, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_53|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_61|, ~sum3~0=v_~sum3~0_41, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_47|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_22|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_24|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~sum2~0=v_~sum2~0_53, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_27|, ~N~0=v_~N~0_59, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_24|, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_27|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_47|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_61, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_43|, ~sum1~0=v_~sum1~0_57, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_34|, #valid=|v_#valid_196|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_34|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_39|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ~sum3~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#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_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, ~sum2~0, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.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, ~M~0, ULTIMATE.start_main_#t~pre14#1, ~sum1~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 160#[L100-6]don't care [2022-07-22 12:24:26,418 INFO L750 eck$LassoCheckResult]: Loop: 160#[L100-6]don't care [531] L100-6-->L100-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23| .cse1))) (and (= (select |v_#valid_130| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|) 1) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_32|) (= (store |v_#memory_int_90| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23| (store (select |v_#memory_int_90| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_17|)) |v_#memory_int_89|) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23| .cse1 4) (select |v_#length_95| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|))))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_17|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_90|, #length=|v_#length_95|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_32|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_89|, #length=|v_#length_95|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_21|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23|} 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] 160#[L100-6]don't care [2022-07-22 12:24:26,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:26,427 INFO L85 PathProgramCache]: Analyzing trace with hash 585, now seen corresponding path program 1 times [2022-07-22 12:24:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:26,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084412049] [2022-07-22 12:24:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:26,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:26,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:26,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 562, now seen corresponding path program 1 times [2022-07-22 12:24:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:26,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372350390] [2022-07-22 12:24:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:26,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:26,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 18666, now seen corresponding path program 1 times [2022-07-22 12:24:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:26,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573769183] [2022-07-22 12:24:26,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:26,791 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:26,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:27,470 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:27,470 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:27,471 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:27,471 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:27,471 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:24:27,471 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:27,471 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:27,471 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:27,472 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sum-array-hom.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:24:27,472 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:27,472 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:27,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:27,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:28,485 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:24:28,490 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:24:28,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:28,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:28,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:28,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:24:28,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:28,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:28,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:28,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:28,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:28,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:28,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:28,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:28,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:28,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:28,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:28,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:28,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:28,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:24:28,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:28,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:28,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:28,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:28,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:28,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:28,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:28,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:28,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:28,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:28,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:28,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:28,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:28,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:24:28,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:28,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:28,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:28,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:28,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:28,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:28,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:28,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:28,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:28,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:28,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:28,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:28,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:24:28,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:28,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:28,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:28,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:28,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:28,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:28,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:28,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:28,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:28,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:28,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:28,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:28,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:24:28,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:28,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:28,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:28,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:28,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:28,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:28,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:28,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:28,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-22 12:24:28,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:28,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:28,835 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:28,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:24:28,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:28,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:28,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:28,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:28,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:28,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:28,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:28,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:28,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:28,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:28,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:28,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:28,896 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:28,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:24:28,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:28,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:28,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:28,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:28,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:28,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:28,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:28,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:28,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-22 12:24:28,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:28,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:28,950 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:28,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:24:28,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:28,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:28,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:28,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:28,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:28,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:28,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:28,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-22 12:24:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,008 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:24:29,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:29,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:29,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:29,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,060 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:24:29,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,102 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:24:29,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:29,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:29,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:29,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,140 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:24:29,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:29,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:29,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:29,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,184 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:24:29,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-22 12:24:29,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,223 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:24:29,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:29,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:29,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:29,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 12:24:29,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,262 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:24:29,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,337 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:24:29,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 12:24:29,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,389 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:24:29,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:29,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:29,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:29,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,428 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:24:29,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,498 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:24:29,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,573 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:29,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:29,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:29,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:24:29,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,637 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:24:29,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,717 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:24:29,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,788 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:24:29,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,857 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,870 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:24:29,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,874 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:24:29,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:24:29,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,927 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-22 12:24:29,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,928 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:29,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:29,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:29,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:29,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:29,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:29,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:29,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:29,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:24:29,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:29,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:29,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:29,998 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:24:30,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:30,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,065 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:24:30,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:24:30,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,125 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:24:30,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-22 12:24:30,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:30,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,200 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:24:30,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 12:24:30,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,269 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:24:30,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:30,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,337 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:24:30,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:30,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,409 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:24:30,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:30,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,475 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:24:30,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:30,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,547 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:24:30,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:24:30,605 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 12:24:30,606 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:24:30,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,616 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:30,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:24:30,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:24:30,671 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:24:30,671 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:24:30,672 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-22 12:24:30,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:30,840 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:24:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:30,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:24:30,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:30,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:24:30,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:24:30,972 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:24:30,975 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 106 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:31,049 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 106 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 108 states and 329 transitions. Complement of second has 3 states. [2022-07-22 12:24:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:24:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:24:31,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:24:31,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:31,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:24:31,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:31,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:24:31,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:31,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 329 transitions. [2022-07-22 12:24:31,089 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 62 [2022-07-22 12:24:31,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 100 states and 310 transitions. [2022-07-22 12:24:31,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-22 12:24:31,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2022-07-22 12:24:31,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 310 transitions. [2022-07-22 12:24:31,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:31,115 INFO L220 hiAutomatonCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:24:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 310 transitions. [2022-07-22 12:24:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-22 12:24:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 3.1) internal successors, (310), 99 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 310 transitions. [2022-07-22 12:24:31,184 INFO L242 hiAutomatonCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:24:31,184 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:24:31,185 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:24:31,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 310 transitions. [2022-07-22 12:24:31,192 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 62 [2022-07-22 12:24:31,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:31,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:31,193 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:24:31,193 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:31,194 INFO L748 eck$LassoCheckResult]: Stem: 780#[ULTIMATE.startENTRY]don't care [554] ULTIMATE.startENTRY-->L100-6: Formula: (let ((.cse0 (store |v_#valid_198| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1))) (let ((.cse1 (select |v_#memory_int_149| 1)) (.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_61| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (= (select |v_#valid_198| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= v_~A~0.offset_74 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21| v_~N~0_59) (= 2 (select |v_#length_153| 1)) (= (select |v_#valid_198| 0) 0) (= |v_#NULL.base_12| 0) (= v_~sum1~0_57 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|) 1 0) 0)) (= 32 (select |v_#length_153| 2)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= (select .cse1 1) 0) (= v_~A~0.base_74 0) (= (select |v_#valid_198| 2) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_61|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_53| 0) (= 48 (select .cse1 0)) (= (store (store (store (store |v_#length_153| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_61| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4)) |v_#length_151|) (= (select |v_#valid_198| 1) 1) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46| 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|) (= (store .cse3 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 1) |v_#valid_196|) (< 0 |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_61|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= v_~sum3~0_41 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| |v_#StackHeapBarrier_32|) (= v_~sum2~0_53 0) (= |v_#NULL.offset_12| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_198|, #memory_int=|v_#memory_int_149|, #length=|v_#length_153|} OutVars{~A~0.base=v_~A~0.base_74, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_53|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_61|, ~sum3~0=v_~sum3~0_41, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_47|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_22|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_24|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~sum2~0=v_~sum2~0_53, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_27|, ~N~0=v_~N~0_59, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_24|, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_27|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_47|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_61, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_43|, ~sum1~0=v_~sum1~0_57, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_34|, #valid=|v_#valid_196|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_34|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_39|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ~sum3~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#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_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, ~sum2~0, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.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, ~M~0, ULTIMATE.start_main_#t~pre14#1, ~sum1~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 762#[L100-6]don't care [551] L100-6-->L82-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_#memory_int_143| (store |v_#memory_int_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre10#1_35|))) (= |v_ULTIMATE.start_main_#t~pre10#1_35| |v_#pthreadsForks_95|) (= v_~A~0.offset_70 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= v_~A~0.base_70 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|) (= (ite (and (<= v_~M~0_55 v_~N~0_53) (<= 0 v_~M~0_55)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_143| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= (+ |v_#pthreadsForks_95| 1) |v_#pthreadsForks_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|)) InVars {#pthreadsForks=|v_#pthreadsForks_95|, ~M~0=v_~M~0_55, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_144|, #length=|v_#length_143|, ~N~0=v_~N~0_53, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33|} OutVars{~A~0.base=v_~A~0.base_70, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|, ~N~0=v_~N~0_53, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ~A~0.offset=v_~A~0.offset_70, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_94|, ~M~0=v_~M~0_55, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_35|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 662#[L82-3]don't care [399] L82-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] 664#[L82-4, thread1ENTRY]don't care [361] thread1ENTRY-->L48-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 650#[L82-4, L48-5]don't care [2022-07-22 12:24:31,194 INFO L750 eck$LassoCheckResult]: Loop: 650#[L82-4, L48-5]don't care [543] L48-5-->L48-5: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork0_~i~0_50 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_56))) (and (= (+ (select (select |v_#memory_int_123| v_~A~0.base_56) .cse0) v_~sum1~0_44) v_~sum1~0_43) (< v_thread1Thread1of1ForFork0_~i~0_50 v_~N~0_43) (<= (+ .cse1 v_~A~0.offset_56 4) (select |v_#length_119| v_~A~0.base_56)) (= v_thread1Thread1of1ForFork0_~i~0_49 (+ v_thread1Thread1of1ForFork0_~i~0_50 1)) (<= 0 .cse0) (= (select |v_#valid_158| v_~A~0.base_56) 1)))) InVars {~A~0.base=v_~A~0.base_56, ~A~0.offset=v_~A~0.offset_56, ~sum1~0=v_~sum1~0_44, #valid=|v_#valid_158|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_50, #memory_int=|v_#memory_int_123|, #length=|v_#length_119|, ~N~0=v_~N~0_43} OutVars{~A~0.base=v_~A~0.base_56, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, ~A~0.offset=v_~A~0.offset_56, ~sum1~0=v_~sum1~0_43, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, #valid=|v_#valid_158|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_49, #memory_int=|v_#memory_int_123|, #length=|v_#length_119|, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, ~sum1~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] 650#[L82-4, L48-5]don't care [2022-07-22 12:24:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash 17969976, now seen corresponding path program 1 times [2022-07-22 12:24:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:31,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231758753] [2022-07-22 12:24:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash 574, now seen corresponding path program 1 times [2022-07-22 12:24:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:31,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805528107] [2022-07-22 12:24:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash 557069799, now seen corresponding path program 1 times [2022-07-22 12:24:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656525416] [2022-07-22 12:24:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:24:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:24:31,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656525416] [2022-07-22 12:24:31,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656525416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:24:31,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:24:31,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:24:31,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052099681] [2022-07-22 12:24:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:24:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:24:31,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:24:31,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:24:31,533 INFO L87 Difference]: Start difference. First operand 100 states and 310 transitions. cyclomatic complexity: 273 Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:24:31,689 INFO L93 Difference]: Finished difference Result 197 states and 589 transitions. [2022-07-22 12:24:31,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 589 transitions. [2022-07-22 12:24:31,697 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 110 [2022-07-22 12:24:31,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 193 states and 577 transitions. [2022-07-22 12:24:31,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2022-07-22 12:24:31,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2022-07-22 12:24:31,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 577 transitions. [2022-07-22 12:24:31,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:31,719 INFO L220 hiAutomatonCegarLoop]: Abstraction has 193 states and 577 transitions. [2022-07-22 12:24:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 577 transitions. [2022-07-22 12:24:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 149. [2022-07-22 12:24:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 3.134228187919463) internal successors, (467), 148 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 467 transitions. [2022-07-22 12:24:31,752 INFO L242 hiAutomatonCegarLoop]: Abstraction has 149 states and 467 transitions. [2022-07-22 12:24:31,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:24:31,754 INFO L425 stractBuchiCegarLoop]: Abstraction has 149 states and 467 transitions. [2022-07-22 12:24:31,754 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:24:31,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 467 transitions. [2022-07-22 12:24:31,758 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 86 [2022-07-22 12:24:31,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:31,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:31,759 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:24:31,759 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:31,760 INFO L748 eck$LassoCheckResult]: Stem: 1239#[ULTIMATE.startENTRY]don't care [554] ULTIMATE.startENTRY-->L100-6: Formula: (let ((.cse0 (store |v_#valid_198| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1))) (let ((.cse1 (select |v_#memory_int_149| 1)) (.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_61| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (= (select |v_#valid_198| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= v_~A~0.offset_74 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21| v_~N~0_59) (= 2 (select |v_#length_153| 1)) (= (select |v_#valid_198| 0) 0) (= |v_#NULL.base_12| 0) (= v_~sum1~0_57 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|) 1 0) 0)) (= 32 (select |v_#length_153| 2)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= (select .cse1 1) 0) (= v_~A~0.base_74 0) (= (select |v_#valid_198| 2) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_61|) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_53| 0) (= 48 (select .cse1 0)) (= (store (store (store (store |v_#length_153| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_61| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4)) |v_#length_151|) (= (select |v_#valid_198| 1) 1) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46| 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|) (= (store .cse3 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 1) |v_#valid_196|) (< 0 |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_61|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= v_~sum3~0_41 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| |v_#StackHeapBarrier_32|) (= v_~sum2~0_53 0) (= |v_#NULL.offset_12| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_198|, #memory_int=|v_#memory_int_149|, #length=|v_#length_153|} OutVars{~A~0.base=v_~A~0.base_74, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_53|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_61|, ~sum3~0=v_~sum3~0_41, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_47|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_22|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_24|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~sum2~0=v_~sum2~0_53, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_27|, ~N~0=v_~N~0_59, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_24|, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_27|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_47|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_61, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_43|, ~sum1~0=v_~sum1~0_57, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_34|, #valid=|v_#valid_196|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_34|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_39|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ~sum3~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#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_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, ~sum2~0, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.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, ~M~0, ULTIMATE.start_main_#t~pre14#1, ~sum1~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1197#[L100-6]don't care [531] L100-6-->L100-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23| .cse1))) (and (= (select |v_#valid_130| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|) 1) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_32|) (= (store |v_#memory_int_90| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23| (store (select |v_#memory_int_90| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_17|)) |v_#memory_int_89|) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23| .cse1 4) (select |v_#length_95| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|))))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_17|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_90|, #length=|v_#length_95|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_32|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_89|, #length=|v_#length_95|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_21|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23|} 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] 1199#[L100-6]don't care [551] L100-6-->L82-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_#memory_int_143| (store |v_#memory_int_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre10#1_35|))) (= |v_ULTIMATE.start_main_#t~pre10#1_35| |v_#pthreadsForks_95|) (= v_~A~0.offset_70 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= v_~A~0.base_70 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|) (= (ite (and (<= v_~M~0_55 v_~N~0_53) (<= 0 v_~M~0_55)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_143| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= (+ |v_#pthreadsForks_95| 1) |v_#pthreadsForks_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|)) InVars {#pthreadsForks=|v_#pthreadsForks_95|, ~M~0=v_~M~0_55, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_144|, #length=|v_#length_143|, ~N~0=v_~N~0_53, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33|} OutVars{~A~0.base=v_~A~0.base_70, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|, ~N~0=v_~N~0_53, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ~A~0.offset=v_~A~0.offset_70, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_94|, ~M~0=v_~M~0_55, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_35|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|, #length=|v_#length_143|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1201#[L82-3]don't care [399] L82-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] 1289#[L82-4, thread1ENTRY]don't care [361] thread1ENTRY-->L48-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 1287#[L82-4, L48-5]don't care [2022-07-22 12:24:31,760 INFO L750 eck$LassoCheckResult]: Loop: 1287#[L82-4, L48-5]don't care [543] L48-5-->L48-5: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork0_~i~0_50 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_56))) (and (= (+ (select (select |v_#memory_int_123| v_~A~0.base_56) .cse0) v_~sum1~0_44) v_~sum1~0_43) (< v_thread1Thread1of1ForFork0_~i~0_50 v_~N~0_43) (<= (+ .cse1 v_~A~0.offset_56 4) (select |v_#length_119| v_~A~0.base_56)) (= v_thread1Thread1of1ForFork0_~i~0_49 (+ v_thread1Thread1of1ForFork0_~i~0_50 1)) (<= 0 .cse0) (= (select |v_#valid_158| v_~A~0.base_56) 1)))) InVars {~A~0.base=v_~A~0.base_56, ~A~0.offset=v_~A~0.offset_56, ~sum1~0=v_~sum1~0_44, #valid=|v_#valid_158|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_50, #memory_int=|v_#memory_int_123|, #length=|v_#length_119|, ~N~0=v_~N~0_43} OutVars{~A~0.base=v_~A~0.base_56, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, ~A~0.offset=v_~A~0.offset_56, ~sum1~0=v_~sum1~0_43, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, #valid=|v_#valid_158|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_49, #memory_int=|v_#memory_int_123|, #length=|v_#length_119|, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, ~sum1~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] 1287#[L82-4, L48-5]don't care [2022-07-22 12:24:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash 556621047, now seen corresponding path program 1 times [2022-07-22 12:24:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:31,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47807372] [2022-07-22 12:24:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:31,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,887 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 574, now seen corresponding path program 2 times [2022-07-22 12:24:31,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:31,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726938778] [2022-07-22 12:24:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,952 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:31,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash 75383816, now seen corresponding path program 1 times [2022-07-22 12:24:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:31,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111542485] [2022-07-22 12:24:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:31,996 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:32,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:33,436 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:33,436 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:33,436 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:33,436 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:33,437 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:24:33,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:33,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:33,437 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:33,437 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sum-array-hom.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:24:33,437 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:33,437 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:33,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,749 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:24:33,752 INFO L158 Benchmark]: Toolchain (without parser) took 14112.10ms. Allocated memory was 158.3MB in the beginning and 200.3MB in the end (delta: 41.9MB). Free memory was 132.7MB in the beginning and 158.2MB in the end (delta: -25.5MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. [2022-07-22 12:24:33,752 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 125.8MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:24:33,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.70ms. Allocated memory is still 158.3MB. Free memory was 132.5MB in the beginning and 121.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:24:33,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.66ms. Allocated memory is still 158.3MB. Free memory was 121.5MB in the beginning and 119.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:24:33,754 INFO L158 Benchmark]: Boogie Preprocessor took 85.27ms. Allocated memory is still 158.3MB. Free memory was 119.7MB in the beginning and 118.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:24:33,754 INFO L158 Benchmark]: RCFGBuilder took 586.69ms. Allocated memory is still 158.3MB. Free memory was 118.2MB in the beginning and 103.2MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-07-22 12:24:33,755 INFO L158 Benchmark]: BuchiAutomizer took 12961.46ms. Allocated memory was 158.3MB in the beginning and 200.3MB in the end (delta: 41.9MB). Free memory was 103.0MB in the beginning and 158.2MB in the end (delta: -55.2MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. [2022-07-22 12:24:33,757 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.33ms. Allocated memory is still 125.8MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 370.70ms. Allocated memory is still 158.3MB. Free memory was 132.5MB in the beginning and 121.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.66ms. Allocated memory is still 158.3MB. Free memory was 121.5MB in the beginning and 119.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 85.27ms. Allocated memory is still 158.3MB. Free memory was 119.7MB in the beginning and 118.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 586.69ms. Allocated memory is still 158.3MB. Free memory was 118.2MB in the beginning and 103.2MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 12961.46ms. Allocated memory was 158.3MB in the beginning and 200.3MB in the end (delta: 41.9MB). Free memory was 103.0MB in the beginning and 158.2MB in the end (delta: -55.2MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 151 PlacesBefore, 30 PlacesAfterwards, 153 TransitionsBefore, 24 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 7 FixpointIterations, 87 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 146 TotalNumberOfCompositions, 1856 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1733, positive: 1714, positive conditional: 0, positive unconditional: 1714, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1152, positive: 1140, positive conditional: 0, positive unconditional: 1140, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1152, positive: 1140, positive conditional: 0, positive unconditional: 1140, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1733, positive: 574, positive conditional: 0, positive unconditional: 574, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1152, unknown conditional: 0, unknown unconditional: 1152] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:24:33,807 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...