/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:43:37,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:43:37,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:43:37,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:43:37,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:43:37,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:43:37,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:43:37,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:43:37,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:43:37,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:43:37,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:43:37,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:43:37,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:43:37,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:43:37,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:43:37,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:43:37,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:43:37,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:43:37,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:43:37,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:43:37,252 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:43:37,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:43:37,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:43:37,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:43:37,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:43:37,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:43:37,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:43:37,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:43:37,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:43:37,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:43:37,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:43:37,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:43:37,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:43:37,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:43:37,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:43:37,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:43:37,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:43:37,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:43:37,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:43:37,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:43:37,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:43:37,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:43:37,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:43:37,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:43:37,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:43:37,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:43:37,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:43:37,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:43:37,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:43:37,338 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:43:37,338 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:43:37,338 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:43:37,338 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:43:37,338 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:43:37,339 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:43:37,339 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:43:37,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:43:37,339 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:43:37,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:43:37,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:43:37,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:43:37,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:43:37,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:43:37,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:43:37,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:43:37,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:43:37,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:43:37,341 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:43:37,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:43:37,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:43:37,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:43:37,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:43:37,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:43:37,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:43:37,343 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:43:37,344 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:43:37,344 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:43:37,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:43:37,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:43:37,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:43:37,737 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:43:37,739 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:43:37,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2022-07-22 12:43:37,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe3c8513/fbb85acfc9ed412b935004ae08e9c86f/FLAGd04d9dcfd [2022-07-22 12:43:38,520 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:43:38,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2022-07-22 12:43:38,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe3c8513/fbb85acfc9ed412b935004ae08e9c86f/FLAGd04d9dcfd [2022-07-22 12:43:38,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe3c8513/fbb85acfc9ed412b935004ae08e9c86f [2022-07-22 12:43:38,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:43:38,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:43:38,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:43:38,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:43:38,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:43:38,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:43:38" (1/1) ... [2022-07-22 12:43:38,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391d7f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:38, skipping insertion in model container [2022-07-22 12:43:38,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:43:38" (1/1) ... [2022-07-22 12:43:38,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:43:38,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:43:39,090 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/clever.wvr.c[2133,2146] [2022-07-22 12:43:39,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:43:39,103 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:43:39,127 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/clever.wvr.c[2133,2146] [2022-07-22 12:43:39,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:43:39,145 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:43:39,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39 WrapperNode [2022-07-22 12:43:39,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:43:39,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:43:39,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:43:39,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:43:39,157 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:43:39" (1/1) ... [2022-07-22 12:43:39,166 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:43:39" (1/1) ... [2022-07-22 12:43:39,191 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2022-07-22 12:43:39,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:43:39,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:43:39,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:43:39,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:43:39,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:43:39,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:43:39,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:43:39,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:43:39,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:39,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:39,262 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:43:39,285 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:43:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:43:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:43:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:43:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:43:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:43:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:43:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:43:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:43:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:43:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:43:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:43:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:43:39,337 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:43:39,427 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:43:39,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:43:39,654 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:43:39,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:43:39,666 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:43:39,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:43:39 BoogieIcfgContainer [2022-07-22 12:43:39,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:43:39,670 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:43:39,670 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:43:39,675 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:43:39,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:43:39,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:43:38" (1/3) ... [2022-07-22 12:43:39,677 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@594ff4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:43:39, skipping insertion in model container [2022-07-22 12:43:39,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:43:39,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39" (2/3) ... [2022-07-22 12:43:39,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@594ff4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:43:39, skipping insertion in model container [2022-07-22 12:43:39,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:43:39,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:43:39" (3/3) ... [2022-07-22 12:43:39,680 INFO L322 chiAutomizerObserver]: Analyzing ICFG clever.wvr.c [2022-07-22 12:43:39,820 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:43:39,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 117 transitions, 250 flow [2022-07-22 12:43:39,989 INFO L129 PetriNetUnfolder]: 9/113 cut-off events. [2022-07-22 12:43:39,993 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:43:39,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 9/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-07-22 12:43:39,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 117 transitions, 250 flow [2022-07-22 12:43:40,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 113 transitions, 238 flow [2022-07-22 12:43:40,017 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:43:40,028 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 113 transitions, 238 flow [2022-07-22 12:43:40,031 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 113 transitions, 238 flow [2022-07-22 12:43:40,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 113 transitions, 238 flow [2022-07-22 12:43:40,059 INFO L129 PetriNetUnfolder]: 9/113 cut-off events. [2022-07-22 12:43:40,059 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:43:40,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 9/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-07-22 12:43:40,062 INFO L116 LiptonReduction]: Number of co-enabled transitions 756 [2022-07-22 12:43:43,735 INFO L131 LiptonReduction]: Checked pairs total: 721 [2022-07-22 12:43:43,736 INFO L133 LiptonReduction]: Total number of compositions: 118 [2022-07-22 12:43:43,760 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:43:43,760 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:43:43,760 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:43:43,760 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:43:43,761 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:43:43,761 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:43:43,761 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:43:43,761 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:43:43,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:43:43,803 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:43:43,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:43,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:43,830 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:43:43,830 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:43:43,831 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:43:43,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 25 states, but on-demand construction may add more states [2022-07-22 12:43:43,840 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:43:43,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:43,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:43,841 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:43:43,841 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:43:43,847 INFO L748 eck$LassoCheckResult]: Stem: 116#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 119#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 121#[L75-4, L40-1]don't care [2022-07-22 12:43:43,847 INFO L750 eck$LassoCheckResult]: Loop: 121#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 125#[L41-6, L75-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 121#[L75-4, L40-1]don't care [2022-07-22 12:43:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 14182, now seen corresponding path program 1 times [2022-07-22 12:43:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:43,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198908392] [2022-07-22 12:43:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:43,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:44,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:44,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash 11959, now seen corresponding path program 1 times [2022-07-22 12:43:44,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:44,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831157565] [2022-07-22 12:43:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:44,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:44,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:44,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 13639900, now seen corresponding path program 1 times [2022-07-22 12:43:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:44,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981536494] [2022-07-22 12:43:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:44,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:44,171 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:44,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:44,285 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:44,285 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:44,286 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:44,286 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:44,286 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:44,286 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:44,286 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:44,287 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:44,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:43:44,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:44,287 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:44,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:44,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:44,329 INFO L141 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:43:44,334 INFO L141 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:43:44,336 INFO L141 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:43:44,338 INFO L141 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:43:44,340 INFO L141 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:43:44,409 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:44,410 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:44,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:44,421 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:43:44,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:44,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:44,448 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:43:44,500 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:43:44,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:44,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:44,502 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:43:44,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:44,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:44,524 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:43:44,723 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:44,729 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:43:44,729 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:44,729 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:44,729 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:44,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:44,730 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:44,730 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:44,730 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:44,730 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:44,730 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:43:44,730 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:44,730 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:44,732 INFO L141 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:43:44,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:44,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:44,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:44,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:44,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:44,752 INFO L141 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:43:44,807 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:44,813 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:44,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:44,816 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:43:44,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:44,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:44,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:44,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:44,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:44,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:44,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:44,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:44,838 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:43:44,847 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:44,863 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:44,863 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:44,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:44,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:44,868 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:43:44,872 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:44,872 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:44,873 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:44,874 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~i1~0) = 1*~n~0 - 1*~i1~0 Supporting invariants [] [2022-07-22 12:43:44,888 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:43:44,915 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:43:44,918 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:44,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:44,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:44,999 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:45,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:45,025 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:43:45,096 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:45,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 25 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:45,191 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 25 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 158 transitions. Complement of second has 5 states. [2022-07-22 12:43:45,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-07-22 12:43:45,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:43:45,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:45,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:43:45,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:45,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-22 12:43:45,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:45,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 158 transitions. [2022-07-22 12:43:45,211 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 20 [2022-07-22 12:43:45,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 139 transitions. [2022-07-22 12:43:45,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-22 12:43:45,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-07-22 12:43:45,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 139 transitions. [2022-07-22 12:43:45,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:45,222 INFO L220 hiAutomatonCegarLoop]: Abstraction has 51 states and 139 transitions. [2022-07-22 12:43:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 139 transitions. [2022-07-22 12:43:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2022-07-22 12:43:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 36 states have internal predecessors, (105), 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:43:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 105 transitions. [2022-07-22 12:43:45,258 INFO L242 hiAutomatonCegarLoop]: Abstraction has 37 states and 105 transitions. [2022-07-22 12:43:45,258 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 105 transitions. [2022-07-22 12:43:45,258 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:43:45,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 105 transitions. [2022-07-22 12:43:45,260 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 20 [2022-07-22 12:43:45,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:45,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:45,266 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:43:45,266 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:45,267 INFO L748 eck$LassoCheckResult]: Stem: 276#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 278#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 314#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 326#[L41-6, L75-4]don't care [2022-07-22 12:43:45,267 INFO L750 eck$LassoCheckResult]: Loop: 326#[L41-6, L75-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 326#[L41-6, L75-4]don't care [2022-07-22 12:43:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 439985, now seen corresponding path program 1 times [2022-07-22 12:43:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:45,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985202610] [2022-07-22 12:43:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:45,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:45,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 1 times [2022-07-22 12:43:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:45,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768685332] [2022-07-22 12:43:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:45,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:45,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 13639937, now seen corresponding path program 1 times [2022-07-22 12:43:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058919204] [2022-07-22 12:43:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:45,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:45,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:45,449 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:45,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:45,449 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:45,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:45,449 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:45,450 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:45,450 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:45,450 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:45,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:43:45,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:45,450 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:45,452 INFO L141 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:43:45,455 INFO L141 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:43:45,459 INFO L141 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:43:45,462 INFO L141 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:43:45,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:45,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:43:45,469 INFO L141 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:43:45,471 INFO L141 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:43:45,549 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:45,549 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:45,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:45,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:45,561 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:43:45,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:45,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:45,575 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:43:45,589 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:45,589 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_3=1} Honda state: {v_rep#funAddr~thread2.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:45,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:45,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:45,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:45,623 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:43:45,624 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:43:45,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:45,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:45,660 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:43:45,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:45,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:45,664 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:43:45,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:45,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:45,670 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:43:45,831 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:45,836 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:43:45,836 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:45,836 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:45,836 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:45,836 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:45,836 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:45,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:45,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:45,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:45,837 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:43:45,837 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:45,837 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:45,839 INFO L141 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:43:45,842 INFO L141 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:43:45,844 INFO L141 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:43:45,849 INFO L141 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:43:45,851 INFO L141 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:43:45,853 INFO L141 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:43:45,855 INFO L141 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:43:45,857 INFO L141 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:43:45,918 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:45,918 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:45,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:45,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:45,920 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:43:45,936 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:43:45,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:45,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:45,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:45,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:45,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:45,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:45,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:45,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:45,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:45,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:45,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,000 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:43:46,009 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:43:46,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:46,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:46,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:46,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:46,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:46,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:46,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:46,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:46,072 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:43:46,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,074 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:43:46,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:46,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:46,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:46,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:46,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:46,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:46,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:46,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:46,092 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:43:46,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:46,106 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:46,107 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:46,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,110 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:43:46,114 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:43:46,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:46,115 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:46,115 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:46,115 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~j1~0, ~m~0) = -1*~j1~0 + 1*~m~0 Supporting invariants [] [2022-07-22 12:43:46,151 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:43:46,152 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:46,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:46,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:46,208 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:46,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:46,209 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:43:46,213 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:43:46,213 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 105 transitions. cyclomatic complexity: 89 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:46,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 105 transitions. cyclomatic complexity: 89. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 201 transitions. Complement of second has 3 states. [2022-07-22 12:43:46,279 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:43:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:43:46,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:43:46,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:46,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:43:46,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:46,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:43:46,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:46,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 201 transitions. [2022-07-22 12:43:46,288 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 26 [2022-07-22 12:43:46,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 201 transitions. [2022-07-22 12:43:46,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-07-22 12:43:46,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-07-22 12:43:46,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 201 transitions. [2022-07-22 12:43:46,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:46,298 INFO L220 hiAutomatonCegarLoop]: Abstraction has 71 states and 201 transitions. [2022-07-22 12:43:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 201 transitions. [2022-07-22 12:43:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2022-07-22 12:43:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.925925925925926) internal successors, (158), 53 states have internal predecessors, (158), 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:43:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 158 transitions. [2022-07-22 12:43:46,316 INFO L242 hiAutomatonCegarLoop]: Abstraction has 54 states and 158 transitions. [2022-07-22 12:43:46,317 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 158 transitions. [2022-07-22 12:43:46,317 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:43:46,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 158 transitions. [2022-07-22 12:43:46,319 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 22 [2022-07-22 12:43:46,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:46,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:46,323 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:43:46,323 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:46,324 INFO L748 eck$LassoCheckResult]: Stem: 449#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 451#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 485#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 505#[L41-6, L75-4]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 465#[L76-3, L41-6]don't care [2022-07-22 12:43:46,324 INFO L750 eck$LassoCheckResult]: Loop: 465#[L76-3, L41-6]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 465#[L76-3, L41-6]don't care [2022-07-22 12:43:46,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash 13639929, now seen corresponding path program 1 times [2022-07-22 12:43:46,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:46,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451388295] [2022-07-22 12:43:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:46,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:46,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:46,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 2 times [2022-07-22 12:43:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:46,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145509569] [2022-07-22 12:43:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:46,421 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:46,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash 422838201, now seen corresponding path program 1 times [2022-07-22 12:43:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:46,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007687022] [2022-07-22 12:43:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:46,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:46,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:46,485 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:46,485 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:46,485 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:46,485 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:46,486 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:46,486 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,486 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:46,486 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:46,486 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:43:46,486 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:46,486 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:46,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:43:46,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:46,493 INFO L141 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:43:46,495 INFO L141 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:43:46,497 INFO L141 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:43:46,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:46,500 INFO L141 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:43:46,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:46,557 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:46,557 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:46,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,559 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:43:46,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:46,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:46,599 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:43:46,610 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:46,610 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post1=0} Honda state: {thread1Thread1of1ForFork0_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:46,644 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:43:46,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-22 12:43:46,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,647 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:43:46,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:46,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:46,675 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:43:46,689 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:43:46,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:46,689 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_5=-1} Honda state: {v_rep#funAddr~thread1.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:46,718 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:43:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,719 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:43:46,720 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:43:46,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:46,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:46,757 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:46,757 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_5=1} Honda state: {v_rep#funAddr~thread2.offset_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:46,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:46,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,796 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:43:46,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:46,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:46,821 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:43:46,824 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:46,824 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_5=-1} Honda state: {v_rep#funAddr~thread2.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:46,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 12:43:46,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,856 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:43:46,857 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:43:46,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:46,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:46,868 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:46,869 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post2=0} Honda state: {thread1Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:46,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:46,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,892 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:43:46,892 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:43:46,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:46,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:46,906 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:46,907 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_5=0} Honda state: {v_rep#funAddr~thread1.offset_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:46,939 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:43:46,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,941 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:43:46,942 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:43:46,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:46,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:46,997 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:43:46,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:46,999 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:43:47,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:47,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:47,024 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:43:47,038 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:47,039 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k1~0=0} Honda state: {~k1~0=0} Generalized eigenvectors: [{~k1~0=-5}, {~k1~0=-1}, {~k1~0=7}] Lambdas: [1, 8, 1] Nus: [0, 1] [2022-07-22 12:43:47,075 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:43:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,076 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:43:47,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:47,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:47,093 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:43:47,138 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:43:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,140 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:43:47,146 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:43:47,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:47,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:47,322 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:47,325 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:43:47,326 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:47,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:47,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:47,326 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:47,326 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:47,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:47,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:47,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:43:47,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:47,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:47,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:47,334 INFO L141 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:43:47,337 INFO L141 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:43:47,339 INFO L141 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:43:47,343 INFO L141 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:43:47,345 INFO L141 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:43:47,347 INFO L141 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:43:47,350 INFO L141 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:43:47,401 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:47,402 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:47,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,403 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:43:47,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:47,410 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:43:47,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:47,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:47,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:47,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:47,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:47,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:47,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:47,464 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:43:47,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,465 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:43:47,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:47,477 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:43:47,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:47,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:47,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:47,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:47,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:47,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:47,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:47,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:47,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:43:47,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,506 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:43:47,507 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:43:47,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:47,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:47,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:47,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:47,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:47,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:47,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:47,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:47,563 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:43:47,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,564 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:43:47,566 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:43:47,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:47,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:47,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:47,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:47,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:47,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:47,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:47,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:47,634 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:43:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,636 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:43:47,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:47,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:47,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:47,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:47,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:47,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:47,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:47,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:47,649 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:43:47,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:47,677 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:43:47,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,679 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:43:47,679 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:43:47,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:47,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:47,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:47,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:47,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:47,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:47,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:47,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:47,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:47,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,750 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:43:47,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:47,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:47,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:47,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:47,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:47,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:47,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:47,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:47,770 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:43:47,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:47,816 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:43:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,818 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:43:47,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:47,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:47,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:47,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:47,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:47,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:47,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:47,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:47,833 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:43:47,842 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:47,845 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:43:47,846 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:43:47,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:47,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:47,847 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:43:47,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:47,849 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:47,849 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:47,849 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~j1~0, ~m~0) = -1*~j1~0 + 1*~m~0 Supporting invariants [] [2022-07-22 12:43:47,863 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:43:47,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:47,889 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:47,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:47,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:47,934 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:47,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:47,935 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:43:47,936 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:43:47,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 158 transitions. cyclomatic complexity: 133 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:43:47,964 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 158 transitions. cyclomatic complexity: 133. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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) Result 65 states and 189 transitions. Complement of second has 3 states. [2022-07-22 12:43:47,965 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:43:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:43:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2022-07-22 12:43:47,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:43:47,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:47,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:43:47,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:47,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:43:47,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:47,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 189 transitions. [2022-07-22 12:43:47,970 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 22 [2022-07-22 12:43:47,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 189 transitions. [2022-07-22 12:43:47,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 12:43:47,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:43:47,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 189 transitions. [2022-07-22 12:43:47,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:47,973 INFO L220 hiAutomatonCegarLoop]: Abstraction has 65 states and 189 transitions. [2022-07-22 12:43:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 189 transitions. [2022-07-22 12:43:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-07-22 12:43:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.890909090909091) internal successors, (159), 54 states have internal predecessors, (159), 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:43:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 159 transitions. [2022-07-22 12:43:47,982 INFO L242 hiAutomatonCegarLoop]: Abstraction has 55 states and 159 transitions. [2022-07-22 12:43:47,982 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 159 transitions. [2022-07-22 12:43:47,982 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:43:47,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 159 transitions. [2022-07-22 12:43:47,984 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 22 [2022-07-22 12:43:47,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:47,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:47,984 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:43:47,984 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:47,985 INFO L748 eck$LassoCheckResult]: Stem: 653#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 655#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 687#[L75-4, L40-1]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 715#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 725#[L51-1, L76-4, L40-1]don't care [2022-07-22 12:43:47,985 INFO L750 eck$LassoCheckResult]: Loop: 725#[L51-1, L76-4, L40-1]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 725#[L51-1, L76-4, L40-1]don't care [2022-07-22 12:43:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash 13641413, now seen corresponding path program 1 times [2022-07-22 12:43:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:47,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414557493] [2022-07-22 12:43:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:48,007 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:48,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 1 times [2022-07-22 12:43:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:48,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812065338] [2022-07-22 12:43:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:48,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:48,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash 422884190, now seen corresponding path program 1 times [2022-07-22 12:43:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:48,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866413258] [2022-07-22 12:43:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:48,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:48,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:48,153 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:48,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:48,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:48,154 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:48,154 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:48,154 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,154 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:48,154 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:48,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:43:48,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:48,154 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:48,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,161 INFO L141 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:43:48,163 INFO L141 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:43:48,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,169 INFO L141 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:43:48,221 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:48,221 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,226 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:43:48,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:48,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:48,247 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:43:48,252 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:48,252 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_7=-1} Honda state: {v_rep#funAddr~thread2.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:48,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 12:43:48,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,280 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:43:48,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:48,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:48,285 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:43:48,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:48,296 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_7=-1} Honda state: {v_rep#funAddr~thread1.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:48,317 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:43:48,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,318 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:43:48,319 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:43:48,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:48,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:48,335 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:48,335 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_7=0} Honda state: {v_rep#funAddr~thread1.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:48,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 12:43:48,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,358 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:43:48,358 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:43:48,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:48,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:48,366 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:48,367 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post4=0} Honda state: {thread2Thread1of1ForFork1_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:48,389 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:43:48,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,391 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:43:48,392 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:43:48,397 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:48,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:48,413 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:48,414 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_7=1} Honda state: {v_rep#funAddr~thread2.offset_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:48,435 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:43:48,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,437 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:48,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:43:48,438 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:48,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:48,446 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:48,447 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k2~0=0, ~m~0=0} Honda state: {~k2~0=0, ~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:48,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 12:43:48,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,469 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:48,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:48,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:48,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:43:48,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:48,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,530 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:48,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:48,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:48,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:43:48,692 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:48,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:48,695 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:48,696 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:48,696 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:48,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:48,696 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:48,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,696 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:48,696 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:48,696 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:43:48,696 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:48,696 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:48,698 INFO L141 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:43:48,706 INFO L141 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:43:48,708 INFO L141 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:43:48,709 INFO L141 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:43:48,711 INFO L141 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:43:48,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,716 INFO L141 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:43:48,770 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:48,771 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:48,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,772 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:48,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:48,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:48,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:48,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:48,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:48,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:48,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:48,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:43:48,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:48,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:48,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,837 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:48,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:48,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:48,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:48,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:48,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:48,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:48,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:48,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:48,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:43:48,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:48,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:48,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,907 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:48,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:48,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:48,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:48,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:48,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:48,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:48,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:48,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:43:48,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:48,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:48,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:48,986 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:48,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:49,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:49,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:49,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:49,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:49,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:43:49,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:49,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:49,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:49,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,069 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:49,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:49,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:49,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:49,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:49,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:49,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:49,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:43:49,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:49,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,131 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:49,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:49,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:49,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:49,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:49,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:49,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:49,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:49,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:43:49,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:49,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,194 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:49,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:49,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:49,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:49,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:49,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:49,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:49,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:49,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:43:49,222 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:49,231 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:49,231 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:49,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,233 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:49,238 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:49,238 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:49,238 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~n~0) = -1*~i2~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:43:49,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 12:43:49,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 12:43:49,277 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:49,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:49,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:49,331 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:49,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:49,332 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:43:49,334 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:43:49,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 159 transitions. cyclomatic complexity: 134 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:43:49,390 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 159 transitions. cyclomatic complexity: 134. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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) Result 77 states and 241 transitions. Complement of second has 3 states. [2022-07-22 12:43:49,392 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:43:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:43:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-07-22 12:43:49,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:43:49,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:49,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:43:49,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:49,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:43:49,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:49,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 241 transitions. [2022-07-22 12:43:49,404 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 21 [2022-07-22 12:43:49,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 241 transitions. [2022-07-22 12:43:49,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 12:43:49,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-07-22 12:43:49,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 241 transitions. [2022-07-22 12:43:49,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:49,416 INFO L220 hiAutomatonCegarLoop]: Abstraction has 77 states and 241 transitions. [2022-07-22 12:43:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 241 transitions. [2022-07-22 12:43:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-07-22 12:43:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 3.0317460317460316) internal successors, (191), 62 states have internal predecessors, (191), 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:43:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 191 transitions. [2022-07-22 12:43:49,436 INFO L242 hiAutomatonCegarLoop]: Abstraction has 63 states and 191 transitions. [2022-07-22 12:43:49,436 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 191 transitions. [2022-07-22 12:43:49,437 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:43:49,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 191 transitions. [2022-07-22 12:43:49,442 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 21 [2022-07-22 12:43:49,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:49,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:49,442 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2022-07-22 12:43:49,443 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:49,443 INFO L748 eck$LassoCheckResult]: Stem: 867#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 869#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 903#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 935#[L41-6, L75-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 941#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 943#[L41-6, L75-4]don't care [2022-07-22 12:43:49,443 INFO L750 eck$LassoCheckResult]: Loop: 943#[L41-6, L75-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 943#[L41-6, L75-4]don't care [2022-07-22 12:43:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 422837243, now seen corresponding path program 2 times [2022-07-22 12:43:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:49,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054048992] [2022-07-22 12:43:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:49,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:49,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:49,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 3 times [2022-07-22 12:43:49,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:49,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319064824] [2022-07-22 12:43:49,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:49,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:49,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash 223053047, now seen corresponding path program 1 times [2022-07-22 12:43:49,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:49,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723138716] [2022-07-22 12:43:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:49,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:43:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:43:49,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723138716] [2022-07-22 12:43:49,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723138716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:43:49,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:43:49,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:43:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615344847] [2022-07-22 12:43:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:43:49,596 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:49,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:49,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:49,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:49,596 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:49,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,596 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:49,597 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:49,597 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:43:49,597 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:49,597 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:49,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,610 INFO L141 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:43:49,645 INFO L141 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:43:49,650 INFO L141 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:43:49,651 INFO L141 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:43:49,679 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:43:49,742 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:49,742 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:49,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,749 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:49,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 12:43:49,779 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:49,779 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_9=0} Honda state: {v_rep#funAddr~thread1.offset_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:49,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,822 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:49,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 12:43:49,846 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:49,847 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_9=-1} Honda state: {v_rep#funAddr~thread2.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:49,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,892 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:49,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 12:43:49,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,956 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:49,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 12:43:49,988 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:49,988 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k1~0=0} Honda state: {~k1~0=0} Generalized eigenvectors: [{~k1~0=-5}, {~k1~0=-1}, {~k1~0=7}] Lambdas: [1, 8, 1] Nus: [0, 1] [2022-07-22 12:43:50,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:50,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,027 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:50,033 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:50,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 12:43:50,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:50,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,093 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:50,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:50,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 12:43:50,333 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:50,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:50,337 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:50,337 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:50,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:50,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:50,337 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:50,337 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,337 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:50,337 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:50,338 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:43:50,338 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:50,338 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:50,339 INFO L141 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:43:50,341 INFO L141 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:43:50,346 INFO L141 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:43:50,348 INFO L141 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:43:50,350 INFO L141 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:43:50,353 INFO L141 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:43:50,355 INFO L141 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:43:50,357 INFO L141 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:43:50,410 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:50,411 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:50,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,412 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:50,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:50,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:50,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:50,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:50,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:50,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:50,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:50,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 12:43:50,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:50,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:50,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,471 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,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:43:50,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:50,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:50,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:50,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:50,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:50,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:50,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:50,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 12:43:50,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:50,505 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:43:50,505 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:43:50,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,507 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,509 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:50,509 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:50,509 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:50,509 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~j1~0, ~m~0) = -1*~j1~0 + 1*~m~0 Supporting invariants [] [2022-07-22 12:43:50,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 12:43:50,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:50,545 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:50,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:50,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:50,591 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:50,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:50,591 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:43:50,592 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:43:50,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 191 transitions. cyclomatic complexity: 162 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:50,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 191 transitions. cyclomatic complexity: 162. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 222 transitions. Complement of second has 3 states. [2022-07-22 12:43:50,640 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:43:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:43:50,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:43:50,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:50,641 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:43:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:50,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:50,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:50,683 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:50,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:50,684 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:43:50,684 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:43:50,685 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 191 transitions. cyclomatic complexity: 162 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:50,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 191 transitions. cyclomatic complexity: 162. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 222 transitions. Complement of second has 3 states. [2022-07-22 12:43:50,725 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:43:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:43:50,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:43:50,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:50,726 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:43:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:50,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:50,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:50,764 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:50,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:50,765 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:43:50,766 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:43:50,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 191 transitions. cyclomatic complexity: 162 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:50,807 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 191 transitions. cyclomatic complexity: 162. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 102 states and 311 transitions. Complement of second has 2 states. [2022-07-22 12:43:50,807 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:43:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-07-22 12:43:50,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:43:50,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:50,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:43:50,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:50,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:43:50,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:50,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 311 transitions. [2022-07-22 12:43:50,813 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 32 [2022-07-22 12:43:50,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 97 states and 299 transitions. [2022-07-22 12:43:50,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-22 12:43:50,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2022-07-22 12:43:50,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 299 transitions. [2022-07-22 12:43:50,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:50,816 INFO L220 hiAutomatonCegarLoop]: Abstraction has 97 states and 299 transitions. [2022-07-22 12:43:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 299 transitions. [2022-07-22 12:43:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2022-07-22 12:43:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 3.1076923076923078) internal successors, (202), 64 states have internal predecessors, (202), 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:43:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 202 transitions. [2022-07-22 12:43:50,825 INFO L242 hiAutomatonCegarLoop]: Abstraction has 65 states and 202 transitions. [2022-07-22 12:43:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:43:50,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:43:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:43:50,829 INFO L87 Difference]: Start difference. First operand 65 states and 202 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:43:50,898 INFO L93 Difference]: Finished difference Result 132 states and 388 transitions. [2022-07-22 12:43:50,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 388 transitions. [2022-07-22 12:43:50,901 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 49 [2022-07-22 12:43:50,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 129 states and 379 transitions. [2022-07-22 12:43:50,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-07-22 12:43:50,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 12:43:50,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 379 transitions. [2022-07-22 12:43:50,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:50,906 INFO L220 hiAutomatonCegarLoop]: Abstraction has 129 states and 379 transitions. [2022-07-22 12:43:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 379 transitions. [2022-07-22 12:43:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2022-07-22 12:43:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 3.0833333333333335) internal successors, (333), 107 states have internal predecessors, (333), 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:43:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 333 transitions. [2022-07-22 12:43:50,916 INFO L242 hiAutomatonCegarLoop]: Abstraction has 108 states and 333 transitions. [2022-07-22 12:43:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:43:50,917 INFO L425 stractBuchiCegarLoop]: Abstraction has 108 states and 333 transitions. [2022-07-22 12:43:50,917 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:43:50,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 333 transitions. [2022-07-22 12:43:50,919 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 41 [2022-07-22 12:43:50,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:50,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:50,920 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:43:50,920 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:43:50,921 INFO L748 eck$LassoCheckResult]: Stem: 1587#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1589#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 1635#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 1647#[L41-6, L75-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 1651#[L75-4, L40-1]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 1657#[L76-3, L40-1]don't care [2022-07-22 12:43:50,921 INFO L750 eck$LassoCheckResult]: Loop: 1657#[L76-3, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 1659#[L76-3, L41-6]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 1657#[L76-3, L40-1]don't care [2022-07-22 12:43:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash 422837294, now seen corresponding path program 1 times [2022-07-22 12:43:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:50,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367526684] [2022-07-22 12:43:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:50,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:50,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash 11959, now seen corresponding path program 2 times [2022-07-22 12:43:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:50,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243228731] [2022-07-22 12:43:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:50,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:50,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1675242588, now seen corresponding path program 2 times [2022-07-22 12:43:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:50,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738833025] [2022-07-22 12:43:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:50,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:50,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:51,012 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:51,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:51,013 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:51,013 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:51,013 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:51,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:51,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:51,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:43:51,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:51,013 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:51,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,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:43:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,024 INFO L141 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:43:51,026 INFO L141 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:43:51,028 INFO L141 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:43:51,030 INFO L141 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:43:51,075 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:51,075 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:51,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:51,077 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:51,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:51,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:51,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 12:43:51,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-22 12:43:51,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:51,119 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:51,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 12:43:51,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:51,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:51,256 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:51,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 12:43:51,259 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:51,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:51,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:51,259 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:51,259 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:51,259 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,259 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:51,259 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:51,259 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:43:51,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:51,260 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:51,261 INFO L141 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:43:51,268 INFO L141 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:43:51,273 INFO L141 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:43:51,278 INFO L141 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:43:51,279 INFO L141 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:43:51,286 INFO L141 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:43:51,288 INFO L141 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:43:51,339 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:51,339 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:51,341 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:51,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 12:43:51,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:51,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:51,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:51,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:51,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:51,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:51,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:51,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:51,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:51,367 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:51,368 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:51,370 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:51,378 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:51,379 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:51,379 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:51,379 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~n~0) = -1*~i1~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:43:51,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 12:43:51,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 12:43:51,405 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:51,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:51,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:51,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:51,449 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:51,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:51,469 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:43:51,470 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:51,470 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 108 states and 333 transitions. cyclomatic complexity: 273 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:51,518 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 108 states and 333 transitions. cyclomatic complexity: 273. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 191 states and 574 transitions. Complement of second has 5 states. [2022-07-22 12:43:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-07-22 12:43:51,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:43:51,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:51,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:43:51,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:51,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 12:43:51,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:51,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 574 transitions. [2022-07-22 12:43:51,524 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 44 [2022-07-22 12:43:51,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 178 states and 541 transitions. [2022-07-22 12:43:51,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-22 12:43:51,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2022-07-22 12:43:51,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 541 transitions. [2022-07-22 12:43:51,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:51,529 INFO L220 hiAutomatonCegarLoop]: Abstraction has 178 states and 541 transitions. [2022-07-22 12:43:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 541 transitions. [2022-07-22 12:43:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 111. [2022-07-22 12:43:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 3.081081081081081) internal successors, (342), 110 states have internal predecessors, (342), 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:43:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 342 transitions. [2022-07-22 12:43:51,540 INFO L242 hiAutomatonCegarLoop]: Abstraction has 111 states and 342 transitions. [2022-07-22 12:43:51,540 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 342 transitions. [2022-07-22 12:43:51,540 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:43:51,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 342 transitions. [2022-07-22 12:43:51,542 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 36 [2022-07-22 12:43:51,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:51,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:51,543 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:43:51,543 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:51,544 INFO L748 eck$LassoCheckResult]: Stem: 2039#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2041#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 2079#[L75-4, L40-1]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 2121#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2191#[L51-1, L76-4, L40-1]don't care [372] L40-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_9| 0) (not (< v_~i1~0_30 v_~n~0_21)) (= |v_thread1Thread1of1ForFork0_#res.offset_9| 0)) InVars {~i1~0=v_~i1~0_30, ~n~0=v_~n~0_21} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_9|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_9|, ~i1~0=v_~i1~0_30, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] 2025#[thread1EXIT, L51-1, L76-4]don't care [2022-07-22 12:43:51,544 INFO L750 eck$LassoCheckResult]: Loop: 2025#[thread1EXIT, L51-1, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 2025#[thread1EXIT, L51-1, L76-4]don't care [2022-07-22 12:43:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash 422884175, now seen corresponding path program 1 times [2022-07-22 12:43:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:51,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670961669] [2022-07-22 12:43:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 2 times [2022-07-22 12:43:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:51,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864896887] [2022-07-22 12:43:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:51,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash 224507924, now seen corresponding path program 1 times [2022-07-22 12:43:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:51,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544968754] [2022-07-22 12:43:51,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:43:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:43:51,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544968754] [2022-07-22 12:43:51,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544968754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:43:51,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:43:51,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:43:51,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175166798] [2022-07-22 12:43:51,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:43:51,652 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:51,652 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:51,652 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:51,652 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:51,653 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:51,653 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,653 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:51,653 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:51,653 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:43:51,653 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:51,653 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:51,654 INFO L141 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:43:51,658 INFO L141 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:43:51,660 INFO L141 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:43:51,662 INFO L141 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:43:51,664 INFO L141 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:43:51,665 INFO L141 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:43:51,669 INFO L141 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:43:51,724 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:51,724 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:51,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:51,725 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:51,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:51,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:51,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 12:43:51,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:51,785 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:51,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:51,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:51,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 12:43:51,945 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:51,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 12:43:51,948 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:51,948 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:51,948 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:51,948 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:51,949 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:51,949 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,949 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:51,949 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:51,949 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:43:51,949 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:51,949 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:51,951 INFO L141 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:43:51,956 INFO L141 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:43:51,958 INFO L141 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:43:51,960 INFO L141 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:43:51,962 INFO L141 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:43:51,964 INFO L141 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:43:51,966 INFO L141 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:43:52,016 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:52,016 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,018 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 12:43:52,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:52,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:52,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:52,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:52,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:52,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:52,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:52,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:52,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:52,078 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:43:52,078 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:52,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,081 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,089 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:52,089 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:52,089 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:52,090 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~n~0) = -1*~i2~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:43:52,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 12:43:52,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,128 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:52,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:52,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:52,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:52,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:52,177 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:52,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:52,178 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:43:52,178 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:43:52,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 342 transitions. cyclomatic complexity: 278 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:52,212 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 342 transitions. cyclomatic complexity: 278. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 116 states and 352 transitions. Complement of second has 3 states. [2022-07-22 12:43:52,212 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:43:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:43:52,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:43:52,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:52,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:43:52,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:52,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:43:52,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:52,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 352 transitions. [2022-07-22 12:43:52,225 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 35 [2022-07-22 12:43:52,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 352 transitions. [2022-07-22 12:43:52,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-07-22 12:43:52,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-07-22 12:43:52,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 352 transitions. [2022-07-22 12:43:52,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:52,231 INFO L220 hiAutomatonCegarLoop]: Abstraction has 116 states and 352 transitions. [2022-07-22 12:43:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 352 transitions. [2022-07-22 12:43:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-07-22 12:43:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 3.0714285714285716) internal successors, (344), 111 states have internal predecessors, (344), 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:43:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 344 transitions. [2022-07-22 12:43:52,249 INFO L242 hiAutomatonCegarLoop]: Abstraction has 112 states and 344 transitions. [2022-07-22 12:43:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:43:52,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:43:52,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:43:52,250 INFO L87 Difference]: Start difference. First operand 112 states and 344 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:43:52,311 INFO L93 Difference]: Finished difference Result 165 states and 486 transitions. [2022-07-22 12:43:52,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 486 transitions. [2022-07-22 12:43:52,315 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 46 [2022-07-22 12:43:52,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 156 states and 474 transitions. [2022-07-22 12:43:52,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-22 12:43:52,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-07-22 12:43:52,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 474 transitions. [2022-07-22 12:43:52,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:52,320 INFO L220 hiAutomatonCegarLoop]: Abstraction has 156 states and 474 transitions. [2022-07-22 12:43:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 474 transitions. [2022-07-22 12:43:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2022-07-22 12:43:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 3.0442477876106193) internal successors, (344), 112 states have internal predecessors, (344), 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:43:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 344 transitions. [2022-07-22 12:43:52,327 INFO L242 hiAutomatonCegarLoop]: Abstraction has 113 states and 344 transitions. [2022-07-22 12:43:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:43:52,328 INFO L425 stractBuchiCegarLoop]: Abstraction has 113 states and 344 transitions. [2022-07-22 12:43:52,329 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:43:52,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 344 transitions. [2022-07-22 12:43:52,330 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 36 [2022-07-22 12:43:52,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:52,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:52,331 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:43:52,331 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:43:52,332 INFO L748 eck$LassoCheckResult]: Stem: 2804#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2806#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 2842#[L75-4, L40-1]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 2874#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2798#[L51-1, L76-4, L40-1]don't care [374] L51-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_9| 0) (not (< v_~i2~0_24 v_~n~0_23)) (= |v_thread2Thread1of1ForFork1_#res.offset_9| 0)) InVars {~i2~0=v_~i2~0_24, ~n~0=v_~n~0_23} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_9|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_9|, ~i2~0=v_~i2~0_24, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] 2792#[thread2EXIT, L76-4, L40-1]don't care [2022-07-22 12:43:52,332 INFO L750 eck$LassoCheckResult]: Loop: 2792#[thread2EXIT, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 2844#[thread2EXIT, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 2998#[thread2EXIT, L41-6, L76-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 2792#[thread2EXIT, L76-4, L40-1]don't care [2022-07-22 12:43:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 422884177, now seen corresponding path program 1 times [2022-07-22 12:43:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620536286] [2022-07-22 12:43:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:52,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:52,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash 372241, now seen corresponding path program 1 times [2022-07-22 12:43:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:52,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560923829] [2022-07-22 12:43:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:52,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:52,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1003780289, now seen corresponding path program 1 times [2022-07-22 12:43:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:52,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725788643] [2022-07-22 12:43:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:43:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:43:52,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725788643] [2022-07-22 12:43:52,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725788643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:43:52,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:43:52,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:43:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318803176] [2022-07-22 12:43:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:43:52,450 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:52,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:52,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:52,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:52,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:52,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:52,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:52,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:43:52,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:52,452 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:52,453 INFO L141 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:43:52,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:43:52,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:43:52,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:43:52,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:43:52,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:52,469 INFO L141 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:43:52,471 INFO L141 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:43:52,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:43:52,477 INFO L141 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:43:52,550 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:52,550 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:52,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,552 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-22 12:43:52,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,599 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-22 12:43:52,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:52,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,794 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:52,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-22 12:43:52,797 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:52,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:52,797 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:52,797 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:52,797 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:52,797 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,797 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:52,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:52,798 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:43:52,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:52,798 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:52,799 INFO L141 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:43:52,804 INFO L141 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:43:52,807 INFO L141 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:43:52,809 INFO L141 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:43:52,810 INFO L141 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:43:52,812 INFO L141 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:43:52,820 INFO L141 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:43:52,821 INFO L141 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:43:52,823 INFO L141 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:43:52,828 INFO L141 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:43:52,893 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:52,893 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:52,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,894 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:52,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:52,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:52,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:52,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:52,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:52,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:52,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:52,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-22 12:43:52,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:52,929 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:52,929 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:52,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,931 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:52,936 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:52,936 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:52,937 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~i1~0) = 1*~n~0 - 1*~i1~0 Supporting invariants [] [2022-07-22 12:43:52,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-22 12:43:52,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,974 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:52,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:53,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:53,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:53,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:53,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:43:53,039 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:53,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 344 transitions. cyclomatic complexity: 279 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:53,083 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 344 transitions. cyclomatic complexity: 279. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 160 states and 429 transitions. Complement of second has 5 states. [2022-07-22 12:43:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-07-22 12:43:53,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2022-07-22 12:43:53,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:53,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2022-07-22 12:43:53,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:53,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2022-07-22 12:43:53,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:53,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 429 transitions. [2022-07-22 12:43:53,088 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 37 [2022-07-22 12:43:53,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 146 states and 398 transitions. [2022-07-22 12:43:53,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-07-22 12:43:53,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2022-07-22 12:43:53,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 398 transitions. [2022-07-22 12:43:53,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:53,092 INFO L220 hiAutomatonCegarLoop]: Abstraction has 146 states and 398 transitions. [2022-07-22 12:43:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 398 transitions. [2022-07-22 12:43:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2022-07-22 12:43:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 2.982608695652174) internal successors, (343), 114 states have internal predecessors, (343), 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:43:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 343 transitions. [2022-07-22 12:43:53,098 INFO L242 hiAutomatonCegarLoop]: Abstraction has 115 states and 343 transitions. [2022-07-22 12:43:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:43:53,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:43:53,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:43:53,099 INFO L87 Difference]: Start difference. First operand 115 states and 343 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:43:53,157 INFO L93 Difference]: Finished difference Result 185 states and 552 transitions. [2022-07-22 12:43:53,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 552 transitions. [2022-07-22 12:43:53,160 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 53 [2022-07-22 12:43:53,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 169 states and 512 transitions. [2022-07-22 12:43:53,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2022-07-22 12:43:53,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2022-07-22 12:43:53,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 512 transitions. [2022-07-22 12:43:53,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:53,163 INFO L220 hiAutomatonCegarLoop]: Abstraction has 169 states and 512 transitions. [2022-07-22 12:43:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 512 transitions. [2022-07-22 12:43:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 140. [2022-07-22 12:43:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 3.1285714285714286) internal successors, (438), 139 states have internal predecessors, (438), 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:43:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 438 transitions. [2022-07-22 12:43:53,170 INFO L242 hiAutomatonCegarLoop]: Abstraction has 140 states and 438 transitions. [2022-07-22 12:43:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:43:53,171 INFO L425 stractBuchiCegarLoop]: Abstraction has 140 states and 438 transitions. [2022-07-22 12:43:53,171 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:43:53,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 438 transitions. [2022-07-22 12:43:53,173 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 47 [2022-07-22 12:43:53,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:53,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:53,173 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:43:53,174 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:53,174 INFO L748 eck$LassoCheckResult]: Stem: 3659#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3661#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 3697#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 3737#[L41-6, L75-4]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 3725#[L76-3, L41-6]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3909#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 3915#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:53,174 INFO L750 eck$LassoCheckResult]: Loop: 3915#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 3915#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 223079490, now seen corresponding path program 1 times [2022-07-22 12:43:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:53,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941816250] [2022-07-22 12:43:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,187 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:53,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 4 times [2022-07-22 12:43:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:53,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524961985] [2022-07-22 12:43:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,203 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1674470000, now seen corresponding path program 2 times [2022-07-22 12:43:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:53,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45085043] [2022-07-22 12:43:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:53,244 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:53,244 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:53,244 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:53,244 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:53,244 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:53,244 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,245 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:53,245 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:53,245 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:43:53,245 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:53,245 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:53,246 INFO L141 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:43:53,250 INFO L141 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:43:53,252 INFO L141 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:43:53,254 INFO L141 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:43:53,266 INFO L141 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:43:53,268 INFO L141 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:43:53,270 INFO L141 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:43:53,272 INFO L141 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:43:53,325 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:53,325 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:53,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:53,330 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:53,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:53,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:53,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-22 12:43:53,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 12:43:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:53,384 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:53,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-22 12:43:53,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:53,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:53,538 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:53,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-22 12:43:53,541 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:53,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:53,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:53,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:53,542 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:53,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:53,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:53,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:43:53,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:53,542 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:53,543 INFO L141 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:43:53,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,553 INFO L141 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:43:53,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,557 INFO L141 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:43:53,559 INFO L141 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:43:53,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,562 INFO L141 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:43:53,621 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:53,621 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:53,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:53,622 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:53,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:53,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:53,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:53,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:53,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:53,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:53,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:53,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:53,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-22 12:43:53,651 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:53,655 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:53,655 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:53,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:53,656 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:53,665 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:53,665 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:53,665 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:53,665 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~j1~0, ~m~0) = -1*~j1~0 + 1*~m~0 Supporting invariants [] [2022-07-22 12:43:53,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-22 12:43:53,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 12:43:53,695 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:53,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:53,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:53,751 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:53,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:53,753 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:43:53,753 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:43:53,754 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 438 transitions. cyclomatic complexity: 354 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:53,805 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 438 transitions. cyclomatic complexity: 354. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 266 states and 805 transitions. Complement of second has 3 states. [2022-07-22 12:43:53,805 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:43:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:43:53,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:43:53,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:53,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:43:53,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:53,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:43:53,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:53,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 805 transitions. [2022-07-22 12:43:53,817 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 67 [2022-07-22 12:43:53,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 263 states and 797 transitions. [2022-07-22 12:43:53,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-07-22 12:43:53,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2022-07-22 12:43:53,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 797 transitions. [2022-07-22 12:43:53,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:53,823 INFO L220 hiAutomatonCegarLoop]: Abstraction has 263 states and 797 transitions. [2022-07-22 12:43:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 797 transitions. [2022-07-22 12:43:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 160. [2022-07-22 12:43:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 160 states have (on average 3.11875) internal successors, (499), 159 states have internal predecessors, (499), 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:43:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 499 transitions. [2022-07-22 12:43:53,831 INFO L242 hiAutomatonCegarLoop]: Abstraction has 160 states and 499 transitions. [2022-07-22 12:43:53,831 INFO L425 stractBuchiCegarLoop]: Abstraction has 160 states and 499 transitions. [2022-07-22 12:43:53,831 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:43:53,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 499 transitions. [2022-07-22 12:43:53,833 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 50 [2022-07-22 12:43:53,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:53,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:53,834 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:43:53,834 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:53,835 INFO L748 eck$LassoCheckResult]: Stem: 4238#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4240#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 4284#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 4328#[L41-6, L75-4]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 4312#[L76-3, L41-6]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4524#[L51-1, L41-6, L76-4]don't care [358] L76-4-->L77-1: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_13|) (= (select (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_13|) |v_ULTIMATE.start_main_#t~mem16#1_10|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_13|) (select |v_#length_27| |v_ULTIMATE.start_main_~#t1~0#1.base_15|)) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) 1)) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_13|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_15|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_10|, #length=|v_#length_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_13|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] 4522#[L41-6, L51-1, L77-1]don't care [2022-07-22 12:43:53,835 INFO L750 eck$LassoCheckResult]: Loop: 4522#[L41-6, L51-1, L77-1]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 4522#[L41-6, L51-1, L77-1]don't care [2022-07-22 12:43:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash 223079446, now seen corresponding path program 1 times [2022-07-22 12:43:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:53,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863688465] [2022-07-22 12:43:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,869 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:53,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 3 times [2022-07-22 12:43:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:53,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284255624] [2022-07-22 12:43:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1674471379, now seen corresponding path program 1 times [2022-07-22 12:43:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:53,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083184236] [2022-07-22 12:43:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,923 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:53,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:53,958 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:53,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:53,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:53,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:53,959 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:53,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,959 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:53,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:53,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:43:53,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:53,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:53,960 INFO L141 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:43:53,961 INFO L141 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:43:53,963 INFO L141 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:43:53,968 INFO L141 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:43:53,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,973 INFO L141 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:43:53,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:54,025 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:54,026 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:54,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,027 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 12:43:54,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:54,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:54,038 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:54,038 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post4=0} Honda state: {thread2Thread1of1ForFork1_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:54,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-22 12:43:54,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,063 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 12:43:54,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:54,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:54,076 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:54,076 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k2~0=0, ~m~0=0} Honda state: {~k2~0=0, ~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:54,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,099 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-22 12:43:54,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:54,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:54,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 12:43:54,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,134 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 12:43:54,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:54,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:54,283 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:54,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-22 12:43:54,285 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:54,285 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:54,285 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:54,285 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:54,286 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:54,286 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,286 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:54,286 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:54,286 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:43:54,286 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:54,286 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:54,287 INFO L141 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:43:54,291 INFO L141 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:43:54,292 INFO L141 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:43:54,298 INFO L141 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:43:54,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:54,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:54,303 INFO L141 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:43:54,357 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:54,357 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:54,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,359 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 12:43:54,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:54,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:54,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-22 12:43:54,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,428 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,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:43:54,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:54,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-22 12:43:54,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,484 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 12:43:54,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:54,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:54,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,497 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:54,504 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:54,505 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:54,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,508 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 12:43:54,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:54,514 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:54,514 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:54,514 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~i2~0) = 1*~n~0 - 1*~i2~0 Supporting invariants [] [2022-07-22 12:43:54,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,539 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:54,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:54,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:54,583 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:54,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:54,583 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:43:54,584 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:43:54,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 160 states and 499 transitions. cyclomatic complexity: 399 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:54,624 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 160 states and 499 transitions. cyclomatic complexity: 399. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 219 states and 652 transitions. Complement of second has 3 states. [2022-07-22 12:43:54,625 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:43:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:43:54,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:43:54,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:54,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:43:54,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:54,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:43:54,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:54,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 652 transitions. [2022-07-22 12:43:54,631 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 47 [2022-07-22 12:43:54,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 213 states and 640 transitions. [2022-07-22 12:43:54,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2022-07-22 12:43:54,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2022-07-22 12:43:54,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 640 transitions. [2022-07-22 12:43:54,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:54,636 INFO L220 hiAutomatonCegarLoop]: Abstraction has 213 states and 640 transitions. [2022-07-22 12:43:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 640 transitions. [2022-07-22 12:43:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 178. [2022-07-22 12:43:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 3.134831460674157) internal successors, (558), 177 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 558 transitions. [2022-07-22 12:43:54,643 INFO L242 hiAutomatonCegarLoop]: Abstraction has 178 states and 558 transitions. [2022-07-22 12:43:54,643 INFO L425 stractBuchiCegarLoop]: Abstraction has 178 states and 558 transitions. [2022-07-22 12:43:54,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:43:54,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 558 transitions. [2022-07-22 12:43:54,646 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 47 [2022-07-22 12:43:54,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:54,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:54,646 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:43:54,646 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:54,647 INFO L748 eck$LassoCheckResult]: Stem: 4814#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4816#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 4852#[L75-4, L40-1]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 4888#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4806#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 4812#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 4992#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:54,647 INFO L750 eck$LassoCheckResult]: Loop: 4992#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 4992#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:54,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash 224507025, now seen corresponding path program 1 times [2022-07-22 12:43:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:54,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176044159] [2022-07-22 12:43:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:54,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 4 times [2022-07-22 12:43:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:54,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617084012] [2022-07-22 12:43:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1630216430, now seen corresponding path program 2 times [2022-07-22 12:43:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:54,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218395234] [2022-07-22 12:43:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:54,717 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:54,717 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:54,717 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:54,718 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:54,718 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:54,718 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,718 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:54,718 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:54,718 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:43:54,718 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:54,718 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:54,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:54,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:54,726 INFO L141 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:43:54,728 INFO L141 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:43:54,730 INFO L141 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:43:54,732 INFO L141 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:43:54,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:54,778 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:54,778 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:54,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,781 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:54,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:54,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-22 12:43:54,810 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:54,810 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k2~0=0, ~m~0=0} Honda state: {~k2~0=0, ~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:54,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-22 12:43:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,842 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 12:43:54,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:54,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:54,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-22 12:43:54,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,875 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 12:43:54,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:54,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,026 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:55,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-22 12:43:55,029 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:55,030 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:55,030 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:55,030 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:55,030 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:55,030 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,030 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:55,030 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:55,030 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:43:55,030 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:55,030 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:55,031 INFO L141 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:43:55,035 INFO L141 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:43:55,041 INFO L141 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:43:55,042 INFO L141 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:43:55,044 INFO L141 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:43:55,046 INFO L141 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:43:55,048 INFO L141 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:43:55,098 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:55,099 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:55,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,100 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 12:43:55,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:55,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:55,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:55,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:55,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:55,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:55,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:55,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:55,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:55,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,136 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 12:43:55,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:55,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:55,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:55,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:55,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:55,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:55,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:55,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:55,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:55,153 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:55,153 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:55,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,156 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 12:43:55,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:55,157 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:55,158 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:55,158 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~i2~0) = 1*~n~0 - 1*~i2~0 Supporting invariants [] [2022-07-22 12:43:55,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,181 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:55,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:55,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:55,233 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:55,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:55,233 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:43:55,234 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:43:55,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 178 states and 558 transitions. cyclomatic complexity: 445 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:55,274 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 178 states and 558 transitions. cyclomatic complexity: 445. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 301 states and 941 transitions. Complement of second has 3 states. [2022-07-22 12:43:55,274 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:43:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:43:55,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:43:55,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:55,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:43:55,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:55,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:43:55,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:55,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 941 transitions. [2022-07-22 12:43:55,282 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 51 [2022-07-22 12:43:55,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 292 states and 929 transitions. [2022-07-22 12:43:55,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2022-07-22 12:43:55,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-07-22 12:43:55,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 929 transitions. [2022-07-22 12:43:55,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:55,288 INFO L220 hiAutomatonCegarLoop]: Abstraction has 292 states and 929 transitions. [2022-07-22 12:43:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 929 transitions. [2022-07-22 12:43:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 217. [2022-07-22 12:43:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 3.207373271889401) internal successors, (696), 216 states have internal predecessors, (696), 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:43:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 696 transitions. [2022-07-22 12:43:55,298 INFO L242 hiAutomatonCegarLoop]: Abstraction has 217 states and 696 transitions. [2022-07-22 12:43:55,298 INFO L425 stractBuchiCegarLoop]: Abstraction has 217 states and 696 transitions. [2022-07-22 12:43:55,298 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 12:43:55,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 696 transitions. [2022-07-22 12:43:55,301 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 49 [2022-07-22 12:43:55,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:55,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:55,302 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:43:55,302 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:43:55,302 INFO L748 eck$LassoCheckResult]: Stem: 5502#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5504#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 5542#[L75-4, L40-1]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 5578#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 5584#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 5762#[L51-1, L41-6, L76-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 5748#[L51-1, L76-4, L40-1]don't care [2022-07-22 12:43:55,303 INFO L750 eck$LassoCheckResult]: Loop: 5748#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 5656#[L51-1, L41-6, L76-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 5748#[L51-1, L76-4, L40-1]don't care [2022-07-22 12:43:55,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 224507003, now seen corresponding path program 1 times [2022-07-22 12:43:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:55,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055761141] [2022-07-22 12:43:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:55,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:55,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 11959, now seen corresponding path program 3 times [2022-07-22 12:43:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:55,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001896214] [2022-07-22 12:43:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:55,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:55,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1002876081, now seen corresponding path program 2 times [2022-07-22 12:43:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:55,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471727560] [2022-07-22 12:43:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:55,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:55,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:55,382 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:55,383 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:55,383 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:55,383 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:55,383 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:55,383 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,383 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:55,383 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:55,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:43:55,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:55,384 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:55,384 INFO L141 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:43:55,386 INFO L141 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:43:55,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,391 INFO L141 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:43:55,394 INFO L141 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:43:55,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,446 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:55,446 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:55,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,447 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 12:43:55,467 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:55,468 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_23=1} Honda state: {v_rep#funAddr~thread2.offset_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:55,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,492 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-22 12:43:55,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,501 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:55,502 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post3=0} Honda state: {thread1Thread1of1ForFork0_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:55,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,525 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 12:43:55,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,539 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:55,540 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_23=0} Honda state: {v_rep#funAddr~thread1.offset_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:55,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,564 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 12:43:55,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,578 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:55,578 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_23=-1} Honda state: {v_rep#funAddr~thread1.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:55,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,602 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 12:43:55,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,612 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:55,612 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~j1~0=0, ~m~0=0} Honda state: {~j1~0=0, ~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:55,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,636 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 12:43:55,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,650 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:55,650 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_23=-1} Honda state: {v_rep#funAddr~thread2.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:55,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,674 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-22 12:43:55,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-22 12:43:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,712 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-22 12:43:55,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:55,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,845 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:55,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:55,848 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:55,849 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:55,849 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:55,849 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:55,849 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:55,849 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,849 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:55,849 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:55,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:43:55,849 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:55,849 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:55,850 INFO L141 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:43:55,853 INFO L141 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:43:55,854 INFO L141 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:43:55,856 INFO L141 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:43:55,858 INFO L141 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:43:55,863 INFO L141 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:43:55,865 INFO L141 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:43:55,920 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:55,920 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:55,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,922 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-22 12:43:55,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:55,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:55,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:55,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:55,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:55,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:55,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:55,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:55,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-07-22 12:43:55,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,960 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-22 12:43:55,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:55,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:55,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:55,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:55,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:55,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:55,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:55,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:55,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:55,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-07-22 12:43:55,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,994 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-22 12:43:55,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:56,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:56,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:56,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:56,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:56,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:56,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:56,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:56,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,049 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-22 12:43:56,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:56,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:56,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:56,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:56,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:56,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:56,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:56,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:56,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,089 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:56,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:56,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:56,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:56,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:56,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:56,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:56,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:56,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-22 12:43:56,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:56,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,154 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-22 12:43:56,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:56,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:56,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:56,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:56,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:56,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:56,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:56,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:56,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-22 12:43:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,199 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-22 12:43:56,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:56,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:56,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:56,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:56,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:56,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:56,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:56,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:56,210 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:56,213 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:56,213 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:56,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,214 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-22 12:43:56,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:56,215 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:56,215 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:56,216 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~n~0) = -1*~i1~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:43:56,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,240 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:56,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:56,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:56,294 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:56,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:56,320 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:43:56,320 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:56,321 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 696 transitions. cyclomatic complexity: 559 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:56,394 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 217 states and 696 transitions. cyclomatic complexity: 559. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 549 states and 1753 transitions. Complement of second has 5 states. [2022-07-22 12:43:56,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-07-22 12:43:56,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:43:56,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:56,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:43:56,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:56,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-22 12:43:56,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:56,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 1753 transitions. [2022-07-22 12:43:56,406 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 77 [2022-07-22 12:43:56,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 438 states and 1417 transitions. [2022-07-22 12:43:56,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2022-07-22 12:43:56,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2022-07-22 12:43:56,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 1417 transitions. [2022-07-22 12:43:56,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:56,417 INFO L220 hiAutomatonCegarLoop]: Abstraction has 438 states and 1417 transitions. [2022-07-22 12:43:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 1417 transitions. [2022-07-22 12:43:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 264. [2022-07-22 12:43:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 264 states have (on average 3.3143939393939394) internal successors, (875), 263 states have internal predecessors, (875), 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:43:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 875 transitions. [2022-07-22 12:43:56,431 INFO L242 hiAutomatonCegarLoop]: Abstraction has 264 states and 875 transitions. [2022-07-22 12:43:56,431 INFO L425 stractBuchiCegarLoop]: Abstraction has 264 states and 875 transitions. [2022-07-22 12:43:56,431 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 12:43:56,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 875 transitions. [2022-07-22 12:43:56,434 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 53 [2022-07-22 12:43:56,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:56,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:56,436 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-22 12:43:56,436 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:56,437 INFO L748 eck$LassoCheckResult]: Stem: 6529#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6531#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 6569#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 6627#[L41-6, L75-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 6639#[L41-6, L75-4]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 6551#[L76-3, L41-6]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 6553#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 7041#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:56,437 INFO L750 eck$LassoCheckResult]: Loop: 7041#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 7041#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:56,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1674141710, now seen corresponding path program 3 times [2022-07-22 12:43:56,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:56,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533693999] [2022-07-22 12:43:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:56,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:56,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:56,471 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 5 times [2022-07-22 12:43:56,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:56,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126988524] [2022-07-22 12:43:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:56,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:56,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash -358785056, now seen corresponding path program 4 times [2022-07-22 12:43:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:56,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255441355] [2022-07-22 12:43:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:56,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:56,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:56,574 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:56,574 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:56,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:56,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:56,575 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:56,575 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,575 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:56,575 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:56,575 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:43:56,575 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:56,575 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:56,576 INFO L141 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:43:56,582 INFO L141 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:43:56,584 INFO L141 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:43:56,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,590 INFO L141 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:43:56,593 INFO L141 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:43:56,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,671 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:56,672 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:56,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,673 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-22 12:43:56,698 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,698 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_25=1} Honda state: {v_rep#funAddr~thread2.offset_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:56,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,725 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-22 12:43:56,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,734 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,734 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post1=0} Honda state: {thread1Thread1of1ForFork0_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:56,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,758 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-22 12:43:56,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,792 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:56,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-22 12:43:56,816 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,816 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k1~0=0} Honda state: {~k1~0=0} Generalized eigenvectors: [{~k1~0=-5}, {~k1~0=-1}, {~k1~0=7}] Lambdas: [1, 8, 1] Nus: [0, 1] [2022-07-22 12:43:56,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,841 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-22 12:43:56,861 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,861 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post2=0} Honda state: {thread1Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:56,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,892 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-22 12:43:56,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,907 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,907 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_25=-1} Honda state: {v_rep#funAddr~thread1.base_25=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:56,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,931 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/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:43:56,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-22 12:43:56,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-07-22 12:43:56,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,969 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/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:43:56,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-22 12:43:56,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:56,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:57,124 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:57,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-22 12:43:57,127 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:57,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:57,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:57,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:57,127 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:57,127 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:57,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:57,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:43:57,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:57,128 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:57,129 INFO L141 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:43:57,130 INFO L141 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:43:57,137 INFO L141 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:43:57,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:57,140 INFO L141 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:43:57,143 INFO L141 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:43:57,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:57,156 INFO L141 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:43:57,203 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:57,203 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,205 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/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:43:57,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-22 12:43:57,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:43:57,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:57,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:57,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-22 12:43:57,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,248 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/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:43:57,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-22 12:43:57,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:57,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:57,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:57,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:57,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,293 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/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:43:57,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-22 12:43:57,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:57,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:57,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:57,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:57,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-22 12:43:57,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,329 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/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:43:57,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-22 12:43:57,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:57,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:57,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:57,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:57,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-22 12:43:57,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,363 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/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:43:57,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-22 12:43:57,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:57,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:57,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:57,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:57,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-22 12:43:57,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,396 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/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:43:57,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-22 12:43:57,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:57,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:57,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:57,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:57,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,434 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/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:43:57,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-22 12:43:57,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:57,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:57,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:57,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:57,445 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:57,448 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:43:57,448 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:43:57,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,449 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/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:43:57,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-22 12:43:57,451 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:57,451 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:57,451 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:57,451 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~m~0, ~j1~0) = 1*~m~0 - 1*~j1~0 Supporting invariants [] [2022-07-22 12:43:57,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-22 12:43:57,476 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:57,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:57,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:57,526 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:57,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:57,526 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:43:57,527 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:43:57,527 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 875 transitions. cyclomatic complexity: 711 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,570 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 875 transitions. cyclomatic complexity: 711. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 386 states and 1240 transitions. Complement of second has 3 states. [2022-07-22 12:43:57,571 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:43:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:43:57,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:43:57,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:57,572 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:43:57,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:57,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:57,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:57,609 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:57,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:57,610 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:43:57,611 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:43:57,612 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 875 transitions. cyclomatic complexity: 711 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 875 transitions. cyclomatic complexity: 711. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 386 states and 1240 transitions. Complement of second has 3 states. [2022-07-22 12:43:57,653 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:43:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:43:57,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:43:57,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:57,654 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:43:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:57,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:57,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:57,694 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:57,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:57,694 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:43:57,696 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:43:57,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 875 transitions. cyclomatic complexity: 711 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 875 transitions. cyclomatic complexity: 711. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 345 states and 1146 transitions. Complement of second has 2 states. [2022-07-22 12:43:57,741 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:43:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-07-22 12:43:57,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:43:57,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:57,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:43:57,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:57,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:43:57,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:57,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 1146 transitions. [2022-07-22 12:43:57,751 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 64 [2022-07-22 12:43:57,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 330 states and 1043 transitions. [2022-07-22 12:43:57,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2022-07-22 12:43:57,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2022-07-22 12:43:57,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 1043 transitions. [2022-07-22 12:43:57,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:57,757 INFO L220 hiAutomatonCegarLoop]: Abstraction has 330 states and 1043 transitions. [2022-07-22 12:43:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 1043 transitions. [2022-07-22 12:43:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2022-07-22 12:43:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 268 states have (on average 3.1902985074626864) internal successors, (855), 267 states have internal predecessors, (855), 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:43:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 855 transitions. [2022-07-22 12:43:57,769 INFO L242 hiAutomatonCegarLoop]: Abstraction has 268 states and 855 transitions. [2022-07-22 12:43:57,769 INFO L425 stractBuchiCegarLoop]: Abstraction has 268 states and 855 transitions. [2022-07-22 12:43:57,769 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 12:43:57,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 855 transitions. [2022-07-22 12:43:57,772 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 55 [2022-07-22 12:43:57,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:57,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:57,773 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:43:57,773 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:43:57,774 INFO L748 eck$LassoCheckResult]: Stem: 8269#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8271#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 8311#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 8347#[L41-6, L75-4]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 8295#[L76-3, L41-6]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 8299#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 8783#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 8751#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:57,774 INFO L750 eck$LassoCheckResult]: Loop: 8751#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 8343#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 8751#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1674470465, now seen corresponding path program 1 times [2022-07-22 12:43:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:57,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541748519] [2022-07-22 12:43:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,789 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash 13360, now seen corresponding path program 1 times [2022-07-22 12:43:57,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:57,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192957623] [2022-07-22 12:43:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,810 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1446631534, now seen corresponding path program 2 times [2022-07-22 12:43:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:57,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490315180] [2022-07-22 12:43:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,856 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:57,922 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:57,922 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:57,922 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:57,922 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:57,922 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:57,922 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,922 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:57,922 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:57,922 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration14_Loop [2022-07-22 12:43:57,923 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:57,923 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:57,924 INFO L141 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:43:57,932 INFO L141 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:43:57,933 INFO L141 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:43:57,939 INFO L141 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:43:57,940 INFO L141 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:43:57,942 INFO L141 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:43:57,944 INFO L141 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:43:57,946 INFO L141 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:43:57,948 INFO L141 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:43:57,950 INFO L141 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:43:58,028 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:58,028 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:58,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,030 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/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:43:58,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-22 12:43:58,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:58,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:58,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:58,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,067 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/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:43:58,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-22 12:43:58,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:58,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:58,222 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:58,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:58,225 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:58,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:58,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:58,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:58,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:58,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:58,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:58,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration14_Loop [2022-07-22 12:43:58,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:58,226 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:58,227 INFO L141 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:43:58,231 INFO L141 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:43:58,233 INFO L141 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:43:58,241 INFO L141 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:43:58,243 INFO L141 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:43:58,245 INFO L141 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:43:58,247 INFO L141 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:43:58,249 INFO L141 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:43:58,251 INFO L141 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:43:58,253 INFO L141 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:43:58,328 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:58,328 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:58,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,329 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/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:43:58,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-07-22 12:43:58,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:58,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:58,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:58,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:58,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:58,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:58,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:58,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:58,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:58,349 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:58,349 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:58,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,350 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/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:43:58,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-22 12:43:58,352 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:58,352 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:58,352 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:58,352 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~i2~0) = 1*~n~0 - 1*~i2~0 Supporting invariants [] [2022-07-22 12:43:58,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:58,375 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:58,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:58,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:58,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:58,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:58,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:58,449 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:43:58,449 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:58,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 855 transitions. cyclomatic complexity: 678 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:58,489 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 855 transitions. cyclomatic complexity: 678. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 409 states and 1279 transitions. Complement of second has 3 states. [2022-07-22 12:43:58,491 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:43:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:43:58,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:43:58,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:58,492 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:43:58,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:58,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:58,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:58,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:58,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:43:58,545 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:58,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 855 transitions. cyclomatic complexity: 678 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:58,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 855 transitions. cyclomatic complexity: 678. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 664 states and 2035 transitions. Complement of second has 5 states. [2022-07-22 12:43:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-22 12:43:58,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:43:58,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:58,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:43:58,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:58,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:43:58,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:58,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 2035 transitions. [2022-07-22 12:43:58,616 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 93 [2022-07-22 12:43:58,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 618 states and 1881 transitions. [2022-07-22 12:43:58,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2022-07-22 12:43:58,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2022-07-22 12:43:58,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 618 states and 1881 transitions. [2022-07-22 12:43:58,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:58,626 INFO L220 hiAutomatonCegarLoop]: Abstraction has 618 states and 1881 transitions. [2022-07-22 12:43:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states and 1881 transitions. [2022-07-22 12:43:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 369. [2022-07-22 12:43:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 369 states have (on average 3.265582655826558) internal successors, (1205), 368 states have internal predecessors, (1205), 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:43:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1205 transitions. [2022-07-22 12:43:58,644 INFO L242 hiAutomatonCegarLoop]: Abstraction has 369 states and 1205 transitions. [2022-07-22 12:43:58,644 INFO L425 stractBuchiCegarLoop]: Abstraction has 369 states and 1205 transitions. [2022-07-22 12:43:58,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 12:43:58,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 1205 transitions. [2022-07-22 12:43:58,649 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 57 [2022-07-22 12:43:58,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:58,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:58,649 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-22 12:43:58,650 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:43:58,650 INFO L748 eck$LassoCheckResult]: Stem: 9954#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 9956#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 9992#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 10042#[L41-6, L75-4]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 10084#[L76-3, L41-6]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 10032#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 10038#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 10138#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:58,650 INFO L750 eck$LassoCheckResult]: Loop: 10138#[L51-1, L41-6, L76-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 10136#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 10138#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:58,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1674407966, now seen corresponding path program 3 times [2022-07-22 12:43:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:58,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491211173] [2022-07-22 12:43:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:58,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:58,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash 12619, now seen corresponding path program 4 times [2022-07-22 12:43:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:58,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129906690] [2022-07-22 12:43:58,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:58,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:58,713 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:58,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:58,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:58,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1506692332, now seen corresponding path program 4 times [2022-07-22 12:43:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:58,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884525239] [2022-07-22 12:43:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:58,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:58,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:58,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:58,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:58,780 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:58,780 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:58,780 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:58,780 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:58,780 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:58,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,781 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:58,781 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:58,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration15_Loop [2022-07-22 12:43:58,781 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:58,781 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:58,782 INFO L141 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:43:58,784 INFO L141 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:43:58,786 INFO L141 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:43:58,787 INFO L141 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:43:58,791 INFO L141 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:43:58,795 INFO L141 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:43:58,796 INFO L141 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:43:58,835 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:58,835 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:58,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,837 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/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:43:58,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-22 12:43:58,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:58,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:58,850 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:58,850 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_29=0} Honda state: {v_rep#funAddr~thread1.offset_29=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:58,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:58,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,873 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/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:43:58,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-22 12:43:58,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:58,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:58,887 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:58,887 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_29=-1} Honda state: {v_rep#funAddr~thread2.base_29=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:58,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-07-22 12:43:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,910 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/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:43:58,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:58,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:58,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-22 12:43:58,931 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:58,931 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_29=-1} Honda state: {v_rep#funAddr~thread1.base_29=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:58,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:58,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,965 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/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:43:58,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-22 12:43:58,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:58,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:58,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2022-07-22 12:43:58,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:58,998 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/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:43:58,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-22 12:43:59,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:59,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,356 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:59,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:59,360 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:59,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:59,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:59,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:59,361 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:59,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:59,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:59,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration15_Loop [2022-07-22 12:43:59,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:59,361 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:59,362 INFO L141 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:43:59,363 INFO L141 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:43:59,365 INFO L141 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:43:59,369 INFO L141 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:43:59,372 INFO L141 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:43:59,376 INFO L141 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:43:59,378 INFO L141 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:43:59,428 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:59,428 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:59,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,430 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/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:43:59,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-22 12:43:59,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:59,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:59,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:59,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:59,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:59,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:59,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:59,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:59,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2022-07-22 12:43:59,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,467 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/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:43:59,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:59,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:59,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:59,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:59,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:59,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-22 12:43:59,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:59,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:59,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:59,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:59,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,509 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/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:43:59,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-22 12:43:59,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:43:59,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:59,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:59,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:59,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:59,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:59,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:59,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:59,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:59,523 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:59,523 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:59,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,524 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/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:43:59,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-22 12:43:59,526 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:59,526 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:59,526 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:59,526 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~n~0) = -1*~i1~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:43:59,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2022-07-22 12:43:59,549 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:59,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:59,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:59,591 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:59,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:59,599 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:43:59,600 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:59,600 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 1205 transitions. cyclomatic complexity: 947 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:59,663 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 1205 transitions. cyclomatic complexity: 947. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 503 states and 1553 transitions. Complement of second has 5 states. [2022-07-22 12:43:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-07-22 12:43:59,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:43:59,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:59,665 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:43:59,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:59,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:59,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:59,705 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:59,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:59,713 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:43:59,714 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:59,714 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 1205 transitions. cyclomatic complexity: 947 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:59,768 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 1205 transitions. cyclomatic complexity: 947. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 503 states and 1553 transitions. Complement of second has 5 states. [2022-07-22 12:43:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-07-22 12:43:59,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:43:59,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:59,770 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:43:59,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:59,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:59,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:59,808 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:59,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:59,817 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:43:59,817 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:43:59,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 1205 transitions. cyclomatic complexity: 947 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:59,884 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 1205 transitions. cyclomatic complexity: 947. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 602 states and 1872 transitions. Complement of second has 4 states. [2022-07-22 12:43:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-07-22 12:43:59,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:43:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:59,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:43:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:59,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:43:59,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:59,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 1872 transitions. [2022-07-22 12:43:59,894 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 69 [2022-07-22 12:43:59,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 545 states and 1667 transitions. [2022-07-22 12:43:59,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2022-07-22 12:43:59,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2022-07-22 12:43:59,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 545 states and 1667 transitions. [2022-07-22 12:43:59,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:43:59,903 INFO L220 hiAutomatonCegarLoop]: Abstraction has 545 states and 1667 transitions. [2022-07-22 12:43:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states and 1667 transitions. [2022-07-22 12:43:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 430. [2022-07-22 12:43:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 430 states have (on average 3.2744186046511627) internal successors, (1408), 429 states have internal predecessors, (1408), 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:43:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1408 transitions. [2022-07-22 12:43:59,919 INFO L242 hiAutomatonCegarLoop]: Abstraction has 430 states and 1408 transitions. [2022-07-22 12:43:59,919 INFO L425 stractBuchiCegarLoop]: Abstraction has 430 states and 1408 transitions. [2022-07-22 12:43:59,920 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 12:43:59,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 430 states and 1408 transitions. [2022-07-22 12:43:59,925 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 57 [2022-07-22 12:43:59,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:59,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:59,926 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-22 12:43:59,926 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:59,926 INFO L748 eck$LassoCheckResult]: Stem: 12400#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 12402#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 12436#[L75-4, L40-1]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 12674#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 12670#[L51-1, L76-4, L40-1]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 12666#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 12668#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 12702#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:59,926 INFO L750 eck$LassoCheckResult]: Loop: 12702#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 12702#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:43:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1630175510, now seen corresponding path program 3 times [2022-07-22 12:43:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:59,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496868988] [2022-07-22 12:43:59,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:59,938 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:59,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 5 times [2022-07-22 12:43:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:59,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970134642] [2022-07-22 12:43:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:59,951 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:59,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:59,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1004167129, now seen corresponding path program 4 times [2022-07-22 12:43:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:59,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36941322] [2022-07-22 12:43:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:59,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:59,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:59,989 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:59,989 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:59,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:59,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:59,990 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:59,990 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,990 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:59,990 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:59,990 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration16_Loop [2022-07-22 12:43:59,990 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:59,990 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:59,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,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:43:59,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:43:59,998 INFO L141 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:44:00,000 INFO L141 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:44:00,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:00,049 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:00,050 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:00,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,052 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/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:44:00,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:00,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:00,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-22 12:44:00,082 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:00,082 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_31=0} Honda state: {v_rep#funAddr~thread1.offset_31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:00,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,122 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/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:44:00,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:00,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:00,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-22 12:44:00,146 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:00,146 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post4=0} Honda state: {thread2Thread1of1ForFork1_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:00,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,184 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/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:44:00,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:00,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:00,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-22 12:44:00,210 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:00,210 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k2~0=0, ~m~0=0} Honda state: {~k2~0=0, ~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:00,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,246 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/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:44:00,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:00,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:00,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-22 12:44:00,270 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:00,270 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_31=1} Honda state: {v_rep#funAddr~thread2.offset_31=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:00,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,307 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/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:44:00,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:00,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:00,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-22 12:44:00,328 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:00,328 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_31=-1} Honda state: {v_rep#funAddr~thread2.base_31=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:00,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,365 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/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:44:00,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:00,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:00,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-22 12:44:00,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,404 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/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:44:00,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-22 12:44:00,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:00,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:00,555 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:00,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,558 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:00,558 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:00,558 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:00,558 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:00,558 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:00,558 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,558 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:00,558 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:00,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration16_Loop [2022-07-22 12:44:00,558 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:00,558 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:00,559 INFO L141 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:44:00,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:00,562 INFO L141 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:44:00,564 INFO L141 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:44:00,566 INFO L141 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:44:00,569 INFO L141 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:44:00,574 INFO L141 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:44:00,624 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:00,624 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:00,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,625 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/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:44:00,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-22 12:44:00,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:44:00,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:00,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,662 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/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:44:00,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-22 12:44:00,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:00,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:00,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,731 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/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:44:00,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:44:00,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:00,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-22 12:44:00,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,790 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/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:44:00,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-22 12:44:00,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:00,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:00,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,830 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/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:44:00,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-07-22 12:44:00,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:44:00,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:00,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:00,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,866 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/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:44:00,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-07-22 12:44:00,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:44:00,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:00,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:00,880 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:44:00,880 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:44:00,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,881 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/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:44:00,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-07-22 12:44:00,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:00,882 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:00,882 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:00,882 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~n~0) = -1*~i2~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:44:00,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,906 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:00,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:00,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:00,946 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:00,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:00,946 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:44:00,947 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:44:00,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 430 states and 1408 transitions. cyclomatic complexity: 1099 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:00,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 430 states and 1408 transitions. cyclomatic complexity: 1099. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 546 states and 1778 transitions. Complement of second has 3 states. [2022-07-22 12:44:00,988 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:44:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:44:00,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:44:00,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:00,989 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:44:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:01,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:01,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:01,032 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:01,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:01,032 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:44:01,033 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:01,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 430 states and 1408 transitions. cyclomatic complexity: 1099 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:01,071 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 430 states and 1408 transitions. cyclomatic complexity: 1099. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 546 states and 1778 transitions. Complement of second has 3 states. [2022-07-22 12:44:01,072 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:44:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:44:01,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:44:01,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:01,073 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:44:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:01,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:01,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:01,115 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:01,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:01,116 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:44:01,117 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:01,117 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 430 states and 1408 transitions. cyclomatic complexity: 1099 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:01,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 430 states and 1408 transitions. cyclomatic complexity: 1099. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 603 states and 1932 transitions. Complement of second has 2 states. [2022-07-22 12:44:01,192 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:44:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-07-22 12:44:01,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:44:01,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:01,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:01,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:01,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:44:01,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:01,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 603 states and 1932 transitions. [2022-07-22 12:44:01,210 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 73 [2022-07-22 12:44:01,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 603 states to 537 states and 1637 transitions. [2022-07-22 12:44:01,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2022-07-22 12:44:01,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2022-07-22 12:44:01,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 537 states and 1637 transitions. [2022-07-22 12:44:01,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:44:01,230 INFO L220 hiAutomatonCegarLoop]: Abstraction has 537 states and 1637 transitions. [2022-07-22 12:44:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states and 1637 transitions. [2022-07-22 12:44:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 367. [2022-07-22 12:44:01,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 367 states have (on average 3.130790190735695) internal successors, (1149), 366 states have internal predecessors, (1149), 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:44:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1149 transitions. [2022-07-22 12:44:01,250 INFO L242 hiAutomatonCegarLoop]: Abstraction has 367 states and 1149 transitions. [2022-07-22 12:44:01,250 INFO L425 stractBuchiCegarLoop]: Abstraction has 367 states and 1149 transitions. [2022-07-22 12:44:01,250 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-22 12:44:01,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 1149 transitions. [2022-07-22 12:44:01,254 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2022-07-22 12:44:01,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:01,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:01,254 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:01,254 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-07-22 12:44:01,255 INFO L748 eck$LassoCheckResult]: Stem: 15046#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15048#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 15080#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 15106#[L41-6, L75-4]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 15476#[L76-3, L41-6]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 15468#[L51-1, L41-6, L76-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 15474#[L51-1, L76-4, L40-1]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 15606#[L51-1, L76-4, L40-1]don't care [2022-07-22 12:44:01,255 INFO L750 eck$LassoCheckResult]: Loop: 15606#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 15620#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 15176#[L51-1, L41-6, L76-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 15248#[L51-1, L76-4, L40-1]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 15606#[L51-1, L76-4, L40-1]don't care [2022-07-22 12:44:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1674471162, now seen corresponding path program 1 times [2022-07-22 12:44:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:01,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930558661] [2022-07-22 12:44:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:01,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 11525443, now seen corresponding path program 1 times [2022-07-22 12:44:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:01,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180689851] [2022-07-22 12:44:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,278 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2001507384, now seen corresponding path program 2 times [2022-07-22 12:44:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:01,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733743646] [2022-07-22 12:44:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:01,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:01,363 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:01,363 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:01,363 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:01,364 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:01,364 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:01,364 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,364 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:01,364 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:01,364 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration17_Loop [2022-07-22 12:44:01,364 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:01,364 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:01,365 INFO L141 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:44:01,367 INFO L141 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:44:01,368 INFO L141 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:44:01,375 INFO L141 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:44:01,377 INFO L141 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:44:01,383 INFO L141 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:44:01,385 INFO L141 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:44:01,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:01,450 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:01,450 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:01,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:01,451 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/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:44:01,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-07-22 12:44:01,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:01,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:01,460 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:01,460 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post3=0} Honda state: {thread1Thread1of1ForFork0_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:01,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:01,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:01,483 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/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:44:01,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-07-22 12:44:01,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:01,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:01,492 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:01,493 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post4=0} Honda state: {thread2Thread1of1ForFork1_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:01,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:01,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:01,516 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/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:44:01,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-07-22 12:44:01,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:01,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:01,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:01,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:01,548 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/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:44:01,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-07-22 12:44:01,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:01,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:01,802 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:01,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:01,805 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:01,805 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:01,805 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:01,805 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:01,805 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:01,806 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,806 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:01,806 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:01,806 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration17_Loop [2022-07-22 12:44:01,806 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:01,806 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:01,807 INFO L141 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:44:01,808 INFO L141 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:44:01,818 INFO L141 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:44:01,828 INFO L141 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:44:01,834 INFO L141 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:44:01,836 INFO L141 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:44:01,839 INFO L141 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:44:01,840 INFO L141 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:44:01,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:01,906 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:01,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:01,908 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/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:44:01,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-07-22 12:44:01,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:44:01,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:01,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:01,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:01,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:01,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:01,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:01,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:01,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:01,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2022-07-22 12:44:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:01,943 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/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:44:01,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-07-22 12:44:01,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:44:01,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:01,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:01,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:01,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:01,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:01,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:01,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:01,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-07-22 12:44:01,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:01,980 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/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:44:01,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-07-22 12:44:01,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:44:01,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:01,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:01,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:01,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:01,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:01,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:01,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:01,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:01,995 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:44:01,995 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:44:01,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:01,996 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/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:44:01,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-07-22 12:44:01,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:01,998 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:01,998 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:01,998 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~n~0) = -1*~i1~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:44:02,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:02,022 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:02,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:02,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:02,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:02,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:02,108 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:44:02,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 367 states and 1149 transitions. cyclomatic complexity: 879 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:02,158 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 367 states and 1149 transitions. cyclomatic complexity: 879. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 789 states and 2457 transitions. Complement of second has 5 states. [2022-07-22 12:44:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-22 12:44:02,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:44:02,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:02,160 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:44:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:02,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:02,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:02,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:02,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:02,232 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:44:02,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 367 states and 1149 transitions. cyclomatic complexity: 879 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:02,319 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 367 states and 1149 transitions. cyclomatic complexity: 879. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 968 states and 3002 transitions. Complement of second has 9 states. [2022-07-22 12:44:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-07-22 12:44:02,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:44:02,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:02,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-22 12:44:02,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:02,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 7 letters. Loop has 8 letters. [2022-07-22 12:44:02,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:02,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 968 states and 3002 transitions. [2022-07-22 12:44:02,337 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 84 [2022-07-22 12:44:02,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 968 states to 863 states and 2671 transitions. [2022-07-22 12:44:02,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2022-07-22 12:44:02,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 225 [2022-07-22 12:44:02,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 2671 transitions. [2022-07-22 12:44:02,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:44:02,350 INFO L220 hiAutomatonCegarLoop]: Abstraction has 863 states and 2671 transitions. [2022-07-22 12:44:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 2671 transitions. [2022-07-22 12:44:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 572. [2022-07-22 12:44:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 572 states have (on average 3.1713286713286712) internal successors, (1814), 571 states have internal predecessors, (1814), 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:44:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1814 transitions. [2022-07-22 12:44:02,378 INFO L242 hiAutomatonCegarLoop]: Abstraction has 572 states and 1814 transitions. [2022-07-22 12:44:02,378 INFO L425 stractBuchiCegarLoop]: Abstraction has 572 states and 1814 transitions. [2022-07-22 12:44:02,378 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-22 12:44:02,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 572 states and 1814 transitions. [2022-07-22 12:44:02,384 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 75 [2022-07-22 12:44:02,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:02,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:02,385 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:02,385 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:44:02,386 INFO L748 eck$LassoCheckResult]: Stem: 17637#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 17639#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 17671#[L75-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 17717#[L41-6, L75-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 17747#[L41-6, L75-4]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 17737#[L76-3, L41-6]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 17731#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 17735#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 18083#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:44:02,386 INFO L750 eck$LassoCheckResult]: Loop: 18083#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 18183#[L51-1, L41-6, L76-4]don't care [365] L41-6-->L40-1: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (not (< v_~j1~0_28 v_~m~0_25))) InVars {~m~0=v_~m~0_25, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_27} OutVars{~m~0=v_~m~0_25, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_17|, ~j1~0=v_~j1~0_28, ~i1~0=v_~i1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] 18187#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 18083#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:44:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -358723022, now seen corresponding path program 1 times [2022-07-22 12:44:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:02,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126045032] [2022-07-22 12:44:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:02,398 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:02,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 427771, now seen corresponding path program 2 times [2022-07-22 12:44:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:02,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309228099] [2022-07-22 12:44:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:02,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:02,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash -838517974, now seen corresponding path program 2 times [2022-07-22 12:44:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:02,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787668721] [2022-07-22 12:44:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:02,429 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:02,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:02,470 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:02,470 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:02,470 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:02,470 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:02,470 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:02,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,470 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:02,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:02,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration18_Loop [2022-07-22 12:44:02,471 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:02,471 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:02,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,473 INFO L141 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:44:02,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,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:44:02,490 INFO L141 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:44:02,492 INFO L141 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:44:02,493 INFO L141 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:44:02,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,557 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:02,557 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:02,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,559 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/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:44:02,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-07-22 12:44:02,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,574 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,574 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_35=-1} Honda state: {v_rep#funAddr~thread1.base_35=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:02,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2022-07-22 12:44:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,597 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/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:44:02,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-07-22 12:44:02,616 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,616 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_35=0} Honda state: {v_rep#funAddr~thread1.offset_35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:02,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2022-07-22 12:44:02,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,643 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/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:44:02,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-07-22 12:44:02,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2022-07-22 12:44:02,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,675 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/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:44:02,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-07-22 12:44:02,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:02,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:03,048 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:03,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,051 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:03,051 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:03,051 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:03,051 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:03,051 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:03,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:03,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:03,051 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration18_Loop [2022-07-22 12:44:03,051 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:03,051 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:03,052 INFO L141 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:44:03,056 INFO L141 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:44:03,058 INFO L141 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:44:03,060 INFO L141 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:44:03,067 INFO L141 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:44:03,070 INFO L141 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:44:03,072 INFO L141 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:44:03,077 INFO L141 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:44:03,079 INFO L141 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:44:03,081 INFO L141 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:44:03,138 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:03,138 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:03,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,140 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/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:44:03,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:03,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:03,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:03,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:03,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-07-22 12:44:03,172 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:03,174 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:44:03,174 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:44:03,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,176 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/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:44:03,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:03,177 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:03,178 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:03,178 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~n~0) = -1*~i1~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:44:03,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-07-22 12:44:03,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,215 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:03,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:03,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:03,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:03,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:44:03,312 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:44:03,313 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 572 states and 1814 transitions. cyclomatic complexity: 1387 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:03,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,400 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 572 states and 1814 transitions. cyclomatic complexity: 1387. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1310 states and 4314 transitions. Complement of second has 6 states. [2022-07-22 12:44:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-07-22 12:44:03,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 3 letters. [2022-07-22 12:44:03,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:03,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2022-07-22 12:44:03,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:03,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 6 letters. [2022-07-22 12:44:03,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:03,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 4314 transitions. [2022-07-22 12:44:03,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,424 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-07-22 12:44:03,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 586 states and 1666 transitions. [2022-07-22 12:44:03,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-07-22 12:44:03,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-07-22 12:44:03,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 586 states and 1666 transitions. [2022-07-22 12:44:03,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:44:03,434 INFO L220 hiAutomatonCegarLoop]: Abstraction has 586 states and 1666 transitions. [2022-07-22 12:44:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states and 1666 transitions. [2022-07-22 12:44:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 290. [2022-07-22 12:44:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 3.0482758620689654) internal successors, (884), 289 states have internal predecessors, (884), 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:44:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 884 transitions. [2022-07-22 12:44:03,450 INFO L242 hiAutomatonCegarLoop]: Abstraction has 290 states and 884 transitions. [2022-07-22 12:44:03,450 INFO L425 stractBuchiCegarLoop]: Abstraction has 290 states and 884 transitions. [2022-07-22 12:44:03,450 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-22 12:44:03,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 884 transitions. [2022-07-22 12:44:03,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:44:03,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:03,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:03,454 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:03,454 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:44:03,454 INFO L748 eck$LassoCheckResult]: Stem: 20160#[ULTIMATE.startENTRY]don't care [417] ULTIMATE.startENTRY-->L75-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse2 (store |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (and (= |v_#NULL.base_10| 0) (= (select |v_#valid_111| 2) 1) (not (= (ite (let ((.cse0 (mod v_~i1~0_54 4294967296))) (and (= v_~i1~0_54 v_~i2~0_52) (= (mod v_~k1~0_59 4294967296) .cse0) (= v_~i1~0_54 0) (= (mod v_~k2~0_55 4294967296) .cse0))) 1 0) 0)) (= (select .cse1 0) 48) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_37|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (< 0 |v_#StackHeapBarrier_22|) (= (store (store |v_#length_68| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_#length_67|) (= (select |v_#valid_111| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select |v_#valid_111| 1) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_37| |v_#pthreadsForks_50|) (= 2 (select |v_#length_68| 1)) (= (select |v_#length_68| 2) 13) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (select .cse1 1) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_#NULL.offset_10| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_45|) (select |v_#length_67| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (= |v_#valid_110| (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1)) (= (ite (<= 0 v_~m~0_59) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= (select |v_#valid_111| 0) 0) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_48|, #length=|v_#length_68|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_48|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_10|, ~i1~0=v_~i1~0_54, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, #pthreadsForks=|v_#pthreadsForks_49|, ~k1~0=v_~k1~0_59, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ~j1~0=v_~j1~0_58, #length=|v_#length_67|, ~m~0=v_~m~0_59, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_48|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~i2~0=v_~i2~0_52, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_48|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_31|, ~k2~0=v_~k2~0_55, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_48|, #valid=|v_#valid_110|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_44|, #memory_int=|v_#memory_int_47|, ~n~0=v_~n~0_41, 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_79|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~i1~0, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ~k1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ~j1~0, #length, ~m~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ~i2~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ~k2~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 20162#[L75-3]don't care [294] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 20192#[L75-4, L40-1]don't care [394] L75-4-->L76-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_37|)) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_36|) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 1) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_31|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 20198#[L76-3, L40-1]don't care [297] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 20290#[L51-1, L76-4, L40-1]don't care [343] L40-1-->L41-6: Formula: (and (< v_~i1~0_18 v_~n~0_13) (= v_~j1~0_16 0)) InVars {~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} OutVars{~j1~0=v_~j1~0_16, ~i1~0=v_~i1~0_18, ~n~0=v_~n~0_13} AuxVars[] AssignedVars[~j1~0] 20448#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 20358#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 20360#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 20368#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:44:03,455 INFO L750 eck$LassoCheckResult]: Loop: 20368#[L51-1, L41-6, L76-4]don't care [402] L41-6-->L41-6: Formula: (and (= v_~j1~0_38 (+ v_~j1~0_39 1)) (< v_~j1~0_39 v_~m~0_39) (= (+ v_~k1~0_36 1) v_~k1~0_35)) InVars {~m~0=v_~m~0_39, ~k1~0=v_~k1~0_36, ~j1~0=v_~j1~0_39} OutVars{~m~0=v_~m~0_39, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_35, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~j1~0=v_~j1~0_38} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] 20366#[L51-1, L41-6, L76-4]don't care [387] L51-1-->L51-1: Formula: (and (< v_~i2~0_31 v_~n~0_25) (= v_~i2~0_30 (+ v_~i2~0_31 1)) (= (+ v_~m~0_29 v_~k2~0_28) v_~k2~0_27)) InVars {~m~0=v_~m~0_29, ~k2~0=v_~k2~0_28, ~i2~0=v_~i2~0_31, ~n~0=v_~n~0_25} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~m~0=v_~m~0_29, ~k2~0=v_~k2~0_27, ~i2~0=v_~i2~0_30, ~n~0=v_~n~0_25} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] 20368#[L51-1, L41-6, L76-4]don't care [2022-07-22 12:44:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1002913489, now seen corresponding path program 3 times [2022-07-22 12:44:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:03,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072438748] [2022-07-22 12:44:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:03,477 INFO L85 PathProgramCache]: Analyzing trace with hash 13810, now seen corresponding path program 2 times [2022-07-22 12:44:03,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:03,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596372503] [2022-07-22 12:44:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:03,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,481 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1727201474, now seen corresponding path program 4 times [2022-07-22 12:44:03,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:03,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298452511] [2022-07-22 12:44:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:03,537 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:03,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:03,537 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:03,537 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:03,537 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:03,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:03,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:03,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration19_Loop [2022-07-22 12:44:03,538 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:03,538 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:03,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,554 INFO L141 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:44:03,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,557 INFO L141 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:44:03,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,625 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:03,626 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:03,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,629 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/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:44:03,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:03,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:03,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-07-22 12:44:03,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,696 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/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:44:03,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:03,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:03,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-07-22 12:44:03,870 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:03,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2022-07-22 12:44:03,872 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:03,873 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:03,873 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:03,873 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:03,873 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:03,873 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,873 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:03,873 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:03,873 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration19_Loop [2022-07-22 12:44:03,873 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:03,873 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:03,875 INFO L141 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:44:03,879 INFO L141 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:44:03,880 INFO L141 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:44:03,883 INFO L141 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:44:03,889 INFO L141 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:44:03,892 INFO L141 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:44:03,894 INFO L141 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:44:03,897 INFO L141 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:44:03,899 INFO L141 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:44:03,900 INFO L141 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:44:03,969 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:03,969 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:03,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,973 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/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:44:03,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-07-22 12:44:03,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:03,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:03,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:03,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:03,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:03,985 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:44:03,985 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:44:03,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,986 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/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:44:03,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-07-22 12:44:03,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:03,988 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:03,988 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:03,988 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~n~0) = -1*~i2~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:44:04,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:04,011 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:04,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:04,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:04,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:04,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:04,066 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:44:04,067 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:44:04,067 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 290 states and 884 transitions. cyclomatic complexity: 663 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:04,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 290 states and 884 transitions. cyclomatic complexity: 663. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 638 states and 1932 transitions. Complement of second has 4 states. [2022-07-22 12:44:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-07-22 12:44:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:44:04,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:44:04,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:04,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:44:04,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:04,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 638 states and 1932 transitions. [2022-07-22 12:44:04,111 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:44:04,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 638 states to 0 states and 0 transitions. [2022-07-22 12:44:04,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 12:44:04,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 12:44:04,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 12:44:04,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:04,112 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:44:04,112 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:44:04,112 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:44:04,113 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-22 12:44:04,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 12:44:04,113 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:44:04,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 12:44:04,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:44:04 BoogieIcfgContainer [2022-07-22 12:44:04,121 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:44:04,122 INFO L158 Benchmark]: Toolchain (without parser) took 25262.79ms. Allocated memory was 153.1MB in the beginning and 231.7MB in the end (delta: 78.6MB). Free memory was 128.9MB in the beginning and 126.9MB in the end (delta: 2.0MB). Peak memory consumption was 81.4MB. Max. memory is 8.0GB. [2022-07-22 12:44:04,123 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:44:04,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.29ms. Allocated memory is still 153.1MB. Free memory was 128.7MB in the beginning and 118.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:44:04,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.90ms. Allocated memory is still 153.1MB. Free memory was 118.2MB in the beginning and 116.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:44:04,124 INFO L158 Benchmark]: Boogie Preprocessor took 29.64ms. Allocated memory is still 153.1MB. Free memory was 116.5MB in the beginning and 115.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:44:04,124 INFO L158 Benchmark]: RCFGBuilder took 446.44ms. Allocated memory is still 153.1MB. Free memory was 115.3MB in the beginning and 102.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-07-22 12:44:04,124 INFO L158 Benchmark]: BuchiAutomizer took 24451.21ms. Allocated memory was 153.1MB in the beginning and 231.7MB in the end (delta: 78.6MB). Free memory was 102.6MB in the beginning and 126.9MB in the end (delta: -24.2MB). Peak memory consumption was 55.2MB. Max. memory is 8.0GB. [2022-07-22 12:44:04,126 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.29ms. Allocated memory is still 153.1MB. Free memory was 128.7MB in the beginning and 118.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.90ms. Allocated memory is still 153.1MB. Free memory was 118.2MB in the beginning and 116.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.64ms. Allocated memory is still 153.1MB. Free memory was 116.5MB in the beginning and 115.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 446.44ms. Allocated memory is still 153.1MB. Free memory was 115.3MB in the beginning and 102.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 24451.21ms. Allocated memory was 153.1MB in the beginning and 231.7MB in the end (delta: 78.6MB). Free memory was 102.6MB in the beginning and 126.9MB in the end (delta: -24.2MB). Peak memory consumption was 55.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 22 terminating modules (3 trivial, 15 deterministic, 4 nondeterministic). One deterministic module has affine ranking function -1 * i1 + n and consists of 3 locations. One deterministic module has affine ranking function -1 * j1 + m and consists of 2 locations. One deterministic module has affine ranking function -1 * j1 + m and consists of 2 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 2 locations. One deterministic module has affine ranking function -1 * i1 + n and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 2 locations. One deterministic module has affine ranking function -1 * i1 + n and consists of 3 locations. One deterministic module has affine ranking function -1 * j1 + m and consists of 2 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 2 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 2 locations. One deterministic module has affine ranking function -1 * i1 + n and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 3 locations. One deterministic module has affine ranking function -1 * i1 + n and consists of 5 locations. One deterministic module has affine ranking function -1 * i1 + n and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * j1 + m and consists of 2 locations. One nondeterministic module has affine ranking function -1 * j1 + m and consists of 2 locations. One nondeterministic module has affine ranking function -1 * i1 + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i2 + n and consists of 2 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.2s and 20 iterations. TraceHistogramMax:2. Analysis of lassos took 16.0s. Construction of modules took 0.9s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 21. Automata minimization 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1852 StatesRemovedByMinimization, 21 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [13, 2, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1206 IncrementalHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 0 mSDtfsCounter, 1206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT16 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax236 hnf100 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf93 smp100 dnf100 smp100 tf112 neg99 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 40 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 19 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.7s InitialAbstractionConstructionTime: 3.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 111 PlacesBefore, 19 PlacesAfterwards, 113 TransitionsBefore, 15 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 6 ConcurrentYvCompositions, 6 ChoiceCompositions, 118 TotalNumberOfCompositions, 721 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 721, positive: 721, positive conditional: 0, positive unconditional: 721, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 401, positive: 401, positive conditional: 0, positive unconditional: 401, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 721, positive: 320, positive conditional: 0, positive unconditional: 320, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 401, unknown conditional: 0, unknown unconditional: 401] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2022-07-22 12:44:04,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2022-07-22 12:44:04,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...