/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:18:11,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:18:11,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:18:11,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:18:11,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:18:11,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:18:11,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:18:11,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:18:11,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:18:11,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:18:11,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:18:11,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:18:11,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:18:11,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:18:11,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:18:11,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:18:11,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:18:11,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:18:11,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:18:11,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:18:11,543 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:18:11,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:18:11,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:18:11,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:18:11,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:18:11,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:18:11,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:18:11,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:18:11,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:18:11,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:18:11,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:18:11,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:18:11,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:18:11,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:18:11,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:18:11,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:18:11,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:18:11,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:18:11,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:18:11,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:18:11,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:18:11,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:18:11,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:18:11,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:18:11,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:18:11,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:18:11,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:18:11,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:18:11,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:18:11,657 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:18:11,657 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:18:11,657 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:18:11,659 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:18:11,659 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:18:11,659 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:18:11,660 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:18:11,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:18:11,660 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:18:11,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:18:11,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:18:11,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:18:11,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:18:11,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:18:11,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:18:11,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:18:11,662 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:18:11,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:18:11,662 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:18:11,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:18:11,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:18:11,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:18:11,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:18:11,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:18:11,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:18:11,667 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:18:11,667 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:18:12,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:18:12,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:18:12,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:18:12,148 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:18:12,149 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:18:12,151 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:18:12,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3173f673/0ee23bb6cfd44d228c51936019e87ad9/FLAG073e45da3 [2022-07-22 12:18:12,858 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:18:12,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2022-07-22 12:18:12,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3173f673/0ee23bb6cfd44d228c51936019e87ad9/FLAG073e45da3 [2022-07-22 12:18:13,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3173f673/0ee23bb6cfd44d228c51936019e87ad9 [2022-07-22 12:18:13,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:18:13,232 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:18:13,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:18:13,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:18:13,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:18:13,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b559bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13, skipping insertion in model container [2022-07-22 12:18:13,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:18:13,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:18:13,456 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:18:13,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:18:13,468 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:18:13,492 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:18:13,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:18:13,510 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:18:13,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13 WrapperNode [2022-07-22 12:18:13,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:18:13,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:18:13,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:18:13,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:18:13,522 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:18:13" (1/1) ... [2022-07-22 12:18:13,531 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:18:13" (1/1) ... [2022-07-22 12:18:13,556 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2022-07-22 12:18:13,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:18:13,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:18:13,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:18:13,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:18:13,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:18:13,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:18:13,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:18:13,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:18:13,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (1/1) ... [2022-07-22 12:18:13,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:13,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:13,637 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:18:13,649 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:18:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:18:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:18:13,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:18:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:18:13,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:18:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:18:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:18:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:18:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:18:13,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:18:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:18:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:18:13,708 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:18:13,865 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:18:13,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:18:14,109 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:18:14,121 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:18:14,122 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:18:14,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:18:14 BoogieIcfgContainer [2022-07-22 12:18:14,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:18:14,126 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:18:14,126 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:18:14,131 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:18:14,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:18:14,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:18:13" (1/3) ... [2022-07-22 12:18:14,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c0e685e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:18:14, skipping insertion in model container [2022-07-22 12:18:14,134 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:18:14,134 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:13" (2/3) ... [2022-07-22 12:18:14,134 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c0e685e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:18:14, skipping insertion in model container [2022-07-22 12:18:14,135 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:18:14,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:18:14" (3/3) ... [2022-07-22 12:18:14,137 INFO L322 chiAutomizerObserver]: Analyzing ICFG clever.wvr.c [2022-07-22 12:18:14,362 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:18:14,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 117 transitions, 250 flow [2022-07-22 12:18:14,486 INFO L129 PetriNetUnfolder]: 9/113 cut-off events. [2022-07-22 12:18:14,487 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:18:14,499 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:18:14,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 117 transitions, 250 flow [2022-07-22 12:18:14,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 113 transitions, 238 flow [2022-07-22 12:18:14,523 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:18:14,545 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 113 transitions, 238 flow [2022-07-22 12:18:14,553 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 113 transitions, 238 flow [2022-07-22 12:18:14,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 113 transitions, 238 flow [2022-07-22 12:18:14,610 INFO L129 PetriNetUnfolder]: 9/113 cut-off events. [2022-07-22 12:18:14,610 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:18:14,613 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:18:14,616 INFO L116 LiptonReduction]: Number of co-enabled transitions 756 [2022-07-22 12:18:18,225 INFO L131 LiptonReduction]: Checked pairs total: 721 [2022-07-22 12:18:18,226 INFO L133 LiptonReduction]: Total number of compositions: 118 [2022-07-22 12:18:18,252 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:18:18,252 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:18:18,252 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:18:18,252 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:18:18,252 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:18:18,253 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:18:18,253 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:18:18,253 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:18:18,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:18:18,295 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:18:18,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:18,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:18,303 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:18:18,303 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:18,305 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:18:18,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 25 states, but on-demand construction may add more states [2022-07-22 12:18:18,313 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:18:18,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:18,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:18,314 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:18:18,315 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:18,328 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:18:18,328 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:18:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash 14182, now seen corresponding path program 1 times [2022-07-22 12:18:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:18,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280339557] [2022-07-22 12:18:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:18,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:18,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:18,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:18,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash 11959, now seen corresponding path program 1 times [2022-07-22 12:18:18,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:18,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522927695] [2022-07-22 12:18:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:18,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:18,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:18,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash 13639900, now seen corresponding path program 1 times [2022-07-22 12:18:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960007161] [2022-07-22 12:18:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:18,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:18,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:18,739 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:18,741 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:18,741 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:18,742 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:18,742 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:18,742 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:18,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:18,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:18,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:18:18,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:18,744 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:18,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:18,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:18,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:18,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:18,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:18,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:18,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:18:18,861 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:18,862 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:18,871 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:18:18,883 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:18:18,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:18,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:18,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:18:18,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:18,958 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:18:18,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:18,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:18,980 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:18:19,179 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:19,186 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:18:19,186 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:19,186 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:19,186 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:19,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:19,187 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:19,187 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:19,187 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:19,187 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:19,187 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:18:19,187 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:19,187 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:19,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,261 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:19,267 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:19,270 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:18:19,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:19,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:19,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:19,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:19,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:19,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:19,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:19,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:19,295 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:18:19,305 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:19,320 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:19,320 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:19,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:19,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:19,323 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:18:19,328 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:19,328 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:19,329 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:19,330 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:18:19,333 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:18:19,374 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:18:19,378 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:19,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:19,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:19,476 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:19,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:19,490 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:18:19,529 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:18:19,532 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:18:19,644 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:18:19,646 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:18:19,653 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:18:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-07-22 12:18:19,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:18:19,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:19,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:18:19,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:19,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-22 12:18:19,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:19,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 158 transitions. [2022-07-22 12:18:19,673 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 20 [2022-07-22 12:18:19,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 139 transitions. [2022-07-22 12:18:19,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-22 12:18:19,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-07-22 12:18:19,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 139 transitions. [2022-07-22 12:18:19,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:19,685 INFO L220 hiAutomatonCegarLoop]: Abstraction has 51 states and 139 transitions. [2022-07-22 12:18:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 139 transitions. [2022-07-22 12:18:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2022-07-22 12:18:19,723 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:18:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 105 transitions. [2022-07-22 12:18:19,730 INFO L242 hiAutomatonCegarLoop]: Abstraction has 37 states and 105 transitions. [2022-07-22 12:18:19,730 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 105 transitions. [2022-07-22 12:18:19,732 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:18:19,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 105 transitions. [2022-07-22 12:18:19,736 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 20 [2022-07-22 12:18:19,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:19,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:19,737 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:18:19,738 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:19,738 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:18:19,739 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:18:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash 439985, now seen corresponding path program 1 times [2022-07-22 12:18:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:19,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637171596] [2022-07-22 12:18:19,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:19,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:19,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:19,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 1 times [2022-07-22 12:18:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:19,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475781910] [2022-07-22 12:18:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:19,856 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:19,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:19,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 13639937, now seen corresponding path program 1 times [2022-07-22 12:18:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:19,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560886384] [2022-07-22 12:18:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:19,917 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:19,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:19,973 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:19,973 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:19,974 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:19,974 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:19,974 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:19,974 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:19,974 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:19,974 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:19,974 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:18:19,975 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:19,978 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:19,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:19,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:18:19,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:18:20,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,076 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:20,076 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:20,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:20,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:20,085 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:18:20,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:20,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:20,100 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:18:20,114 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:20,114 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:18:20,153 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:18:20,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:20,154 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:18:20,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:20,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:20,163 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:18:20,193 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:18:20,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:20,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:20,195 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:18:20,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:20,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:20,202 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:18:20,359 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:20,362 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:18:20,362 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:20,362 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:20,362 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:20,362 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:20,362 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:20,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:20,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:20,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:20,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:18:20,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:20,365 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:20,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:18:20,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,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:18:20,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,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:18:20,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:20,501 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:20,501 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:20,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:20,511 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:18:20,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 12:18:20,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:20,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:20,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:20,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:20,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:20,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:20,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:20,550 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:18:20,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:20,597 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:18:20,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:20,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:20,599 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:18:20,604 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:18:20,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:20,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:20,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:20,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:20,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:20,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:20,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:20,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:20,661 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:18:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:20,663 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:18:20,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:20,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:20,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:20,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:20,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:20,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:20,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:20,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:20,683 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:18:20,690 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:20,698 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:20,698 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:20,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:20,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:20,700 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:18:20,707 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:20,707 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:20,707 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:20,707 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:18:20,722 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:18:20,746 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:18:20,747 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:20,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:20,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:20,790 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:20,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:20,791 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:18:20,796 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:18:20,802 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:18:20,867 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:18:20,867 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:18:20,868 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:18:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:18:20,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:18:20,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:20,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:18:20,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:20,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:18:20,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:20,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 201 transitions. [2022-07-22 12:18:20,876 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 26 [2022-07-22 12:18:20,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 201 transitions. [2022-07-22 12:18:20,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-07-22 12:18:20,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-07-22 12:18:20,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 201 transitions. [2022-07-22 12:18:20,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:20,884 INFO L220 hiAutomatonCegarLoop]: Abstraction has 71 states and 201 transitions. [2022-07-22 12:18:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 201 transitions. [2022-07-22 12:18:20,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2022-07-22 12:18:20,902 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:18:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 158 transitions. [2022-07-22 12:18:20,904 INFO L242 hiAutomatonCegarLoop]: Abstraction has 54 states and 158 transitions. [2022-07-22 12:18:20,904 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 158 transitions. [2022-07-22 12:18:20,905 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:18:20,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 158 transitions. [2022-07-22 12:18:20,910 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 22 [2022-07-22 12:18:20,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:20,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:20,911 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:18:20,911 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:20,912 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:18:20,914 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:18:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:20,915 INFO L85 PathProgramCache]: Analyzing trace with hash 13639929, now seen corresponding path program 1 times [2022-07-22 12:18:20,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:20,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404720269] [2022-07-22 12:18:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:20,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 2 times [2022-07-22 12:18:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:21,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224711351] [2022-07-22 12:18:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:21,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash 422838201, now seen corresponding path program 1 times [2022-07-22 12:18:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:21,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747732846] [2022-07-22 12:18:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,065 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:21,119 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:21,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:21,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:21,120 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:21,120 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:21,120 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,120 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:21,120 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:21,120 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:18:21,120 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:21,120 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:21,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,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:18:21,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,194 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:21,194 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:21,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,199 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:18:21,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:21,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,213 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:18:21,222 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:21,222 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:18:21,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:21,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,251 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:18:21,252 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:18:21,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:21,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:21,275 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:18:21,297 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:18:21,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,298 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:18:21,299 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:18:21,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:21,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:21,313 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:18:21,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 12:18:21,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,339 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:18:21,340 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:18:21,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:21,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,354 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:21,355 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:18:21,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:21,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,381 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:18:21,383 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:18:21,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:21,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,395 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:21,395 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:18:21,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 12:18:21,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,422 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:18:21,423 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:18:21,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:21,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,436 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:21,436 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:18:21,459 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:18:21,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,460 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:18:21,465 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:18:21,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:21,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,518 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:18:21,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,520 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:18:21,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:21,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,538 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:18:21,558 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:21,558 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:18:21,583 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:18:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,584 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:18:21,588 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:18:21,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:21,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-22 12:18:21,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,620 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:18:21,621 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:18:21,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:21,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:21,776 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:21,779 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:18:21,779 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:21,779 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:21,780 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:21,780 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:21,780 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:21,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,781 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:21,781 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:21,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:18:21,781 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:21,781 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:21,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:18:21,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:18:21,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:18:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,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:18:21,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,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:18:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:21,858 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:21,858 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:21,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,860 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:18:21,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:21,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:21,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:21,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:21,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:21,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:21,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:21,879 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:18:21,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:21,933 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:18:21,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:21,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:21,934 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:18:21,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:18:21,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:21,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:21,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:21,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:21,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:21,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:21,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:21,951 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:18:21,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:22,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:22,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,035 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:18:22,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:22,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:22,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:22,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:22,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:22,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:22,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:22,061 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:18:22,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:22,105 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:18:22,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,106 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:18:22,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:22,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:22,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:22,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:22,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:22,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:22,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:22,129 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:18:22,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:22,172 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:18:22,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,173 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:18:22,174 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:18:22,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:22,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:22,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:22,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:22,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:22,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:22,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:22,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:22,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:22,216 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:18:22,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,218 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:18:22,220 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:18:22,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:22,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:22,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:22,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:22,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:22,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:22,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:22,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:22,288 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:18:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,289 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:18:22,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:22,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:22,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:22,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:22,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:22,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:22,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:22,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:22,305 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:18:22,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:22,350 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:18:22,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,354 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:18:22,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:22,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:22,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:22,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:22,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:22,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:22,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:22,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:22,370 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:18:22,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:22,383 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:18:22,384 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:18:22,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,387 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:18:22,391 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:22,392 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:22,392 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:22,392 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:18:22,407 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:18:22,426 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:18:22,427 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:22,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:22,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:22,466 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:22,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:22,467 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:18:22,467 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:18:22,468 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:18:22,493 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:18:22,493 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:18:22,494 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:18:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2022-07-22 12:18:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:18:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:18:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:18:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:22,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 189 transitions. [2022-07-22 12:18:22,497 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 22 [2022-07-22 12:18:22,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 189 transitions. [2022-07-22 12:18:22,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 12:18:22,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:18:22,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 189 transitions. [2022-07-22 12:18:22,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:22,500 INFO L220 hiAutomatonCegarLoop]: Abstraction has 65 states and 189 transitions. [2022-07-22 12:18:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 189 transitions. [2022-07-22 12:18:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-07-22 12:18:22,505 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:18:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 159 transitions. [2022-07-22 12:18:22,506 INFO L242 hiAutomatonCegarLoop]: Abstraction has 55 states and 159 transitions. [2022-07-22 12:18:22,506 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 159 transitions. [2022-07-22 12:18:22,506 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:18:22,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 159 transitions. [2022-07-22 12:18:22,507 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 22 [2022-07-22 12:18:22,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:22,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:22,508 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:18:22,508 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:22,509 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:18:22,509 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:18:22,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 13641413, now seen corresponding path program 1 times [2022-07-22 12:18:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:22,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080148368] [2022-07-22 12:18:22,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:22,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:22,528 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:22,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 1 times [2022-07-22 12:18:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:22,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532619199] [2022-07-22 12:18:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:22,548 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:22,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:22,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash 422884190, now seen corresponding path program 1 times [2022-07-22 12:18:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:22,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587890468] [2022-07-22 12:18:22,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:22,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:22,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:22,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:22,622 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:22,622 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:22,622 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:22,622 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:22,622 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:22,622 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,622 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:22,623 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:22,623 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:18:22,623 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:22,623 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:22,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:22,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:22,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:22,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:22,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:22,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:22,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:22,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:22,681 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:22,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,683 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:18:22,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:22,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:22,703 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:18:22,711 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:22,712 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:18:22,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:22,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,748 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:18:22,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:22,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:22,765 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:18:22,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:22,768 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:18:22,804 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:18:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,805 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:18:22,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:22,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:22,827 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:18:22,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:22,832 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:18:22,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:22,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,871 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:18:22,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:22,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:22,882 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:18:22,891 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:22,891 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:18:22,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 12:18:22,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,925 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:18:22,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:22,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:22,942 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:18:22,947 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:22,947 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:18:22,980 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:18:22,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:22,981 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:18:22,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:22,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:22,989 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:18:22,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:22,993 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:18:23,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:23,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,018 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:18:23,019 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:18:23,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:23,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:23,057 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:18:23,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,058 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:18:23,059 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:18:23,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:23,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:23,209 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:23,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 12:18:23,212 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:23,212 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:23,212 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:23,212 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:23,212 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:23,213 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,213 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:23,213 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:23,213 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:18:23,213 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:23,213 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:23,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,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:18:23,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,295 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:23,295 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,297 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:18:23,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:23,322 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:18:23,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:23,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:23,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:23,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:23,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:23,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:23,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:23,379 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:18:23,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,380 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:18:23,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:23,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:23,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:23,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:23,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:23,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:23,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:23,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:23,420 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:18:23,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:23,467 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:18:23,485 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:18:23,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,486 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:18:23,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:23,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:23,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:23,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:23,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:23,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:23,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:23,508 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:18:23,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:23,522 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:18:23,553 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:18:23,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,556 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:18:23,557 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:18:23,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:23,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:23,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:23,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:23,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:23,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:23,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:23,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:23,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 12:18:23,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,605 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:18:23,606 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:18:23,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:23,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:23,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:23,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:23,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:23,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:23,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:23,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:23,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 12:18:23,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,663 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:18:23,663 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:18:23,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:23,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:23,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:23,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:23,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:23,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:23,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:23,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:23,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:23,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 12:18:23,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,697 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:18:23,700 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:18:23,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:23,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:23,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:23,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:23,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:23,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:23,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:23,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:23,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:23,732 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:23,733 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:23,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:23,736 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:18:23,744 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:23,744 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:23,744 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:23,744 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:18:23,758 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:18:23,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:23,780 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:23,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:23,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:23,818 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:23,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:23,819 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:18:23,820 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:18:23,820 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:18:23,852 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:18:23,852 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:18:23,853 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:18:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-07-22 12:18:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:18:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:18:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:18:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:23,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 241 transitions. [2022-07-22 12:18:23,856 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 21 [2022-07-22 12:18:23,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 241 transitions. [2022-07-22 12:18:23,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 12:18:23,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-07-22 12:18:23,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 241 transitions. [2022-07-22 12:18:23,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:23,859 INFO L220 hiAutomatonCegarLoop]: Abstraction has 77 states and 241 transitions. [2022-07-22 12:18:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 241 transitions. [2022-07-22 12:18:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-07-22 12:18:23,864 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:18:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 191 transitions. [2022-07-22 12:18:23,865 INFO L242 hiAutomatonCegarLoop]: Abstraction has 63 states and 191 transitions. [2022-07-22 12:18:23,865 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 191 transitions. [2022-07-22 12:18:23,866 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:18:23,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 191 transitions. [2022-07-22 12:18:23,867 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 21 [2022-07-22 12:18:23,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:23,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:23,867 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2022-07-22 12:18:23,868 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:23,868 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:18:23,868 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:18:23,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash 422837243, now seen corresponding path program 2 times [2022-07-22 12:18:23,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:23,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546967838] [2022-07-22 12:18:23,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:23,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:23,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:23,896 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 3 times [2022-07-22 12:18:23,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:23,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458331074] [2022-07-22 12:18:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:23,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:23,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash 223053047, now seen corresponding path program 1 times [2022-07-22 12:18:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:23,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668261404] [2022-07-22 12:18:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:23,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:23,969 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:18:23,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:18:23,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668261404] [2022-07-22 12:18:23,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668261404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:18:23,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:18:23,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:18:23,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051929297] [2022-07-22 12:18:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:18:23,989 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:23,989 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:23,989 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:23,989 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:23,989 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:23,989 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:23,989 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:23,989 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:23,989 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:18:23,990 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:23,990 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:23,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:18:23,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:18:23,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,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:18:24,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,054 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:24,055 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:24,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,056 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:18:24,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:24,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:24,073 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:18:24,079 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:24,079 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:18:24,114 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:18:24,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,116 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:18:24,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:24,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:24,132 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:18:24,138 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:24,138 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:18:24,163 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:18:24,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,165 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:18:24,166 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:18:24,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:24,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:24,195 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:18:24,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,196 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:18:24,200 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:18:24,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:24,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:24,224 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:24,224 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:18:24,246 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:18:24,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,248 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:18:24,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:24,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:24,253 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:18:24,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-22 12:18:24,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,280 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:18:24,282 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:18:24,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:24,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:24,434 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:24,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-22 12:18:24,437 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:24,437 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:24,437 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:24,437 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:24,437 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:24,438 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,438 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:24,438 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:24,438 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:18:24,438 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:24,438 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:24,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,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:18:24,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:18:24,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:18:24,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:18:24,522 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:24,523 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:24,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,524 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:18:24,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:24,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:24,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:24,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:24,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:24,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:24,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:24,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:24,548 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:18:24,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:24,595 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:18:24,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,596 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:18:24,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:24,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:24,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:24,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:24,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:24,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:24,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:24,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:24,612 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:18:24,619 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:24,626 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:18:24,626 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:18:24,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,628 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:18:24,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:24,631 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:24,631 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:24,631 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:18:24,645 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:18:24,672 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:18:24,673 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:24,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:24,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:24,723 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:24,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:24,724 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:18:24,725 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:18:24,725 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:18:24,771 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:18:24,772 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:18:24,772 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:18:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:18:24,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:18:24,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:24,773 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:24,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:24,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:24,811 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:24,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:24,812 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:18:24,813 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:18:24,813 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:18:24,849 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:18:24,850 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:18:24,850 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:18:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:18:24,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:18:24,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:24,851 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:24,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:24,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:24,887 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:24,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:24,887 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:18:24,888 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:18:24,888 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:18:24,928 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:18:24,929 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:18:24,930 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:18:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-07-22 12:18:24,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:18:24,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:24,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:18:24,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:24,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:18:24,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:24,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 311 transitions. [2022-07-22 12:18:24,933 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 32 [2022-07-22 12:18:24,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 97 states and 299 transitions. [2022-07-22 12:18:24,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-22 12:18:24,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2022-07-22 12:18:24,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 299 transitions. [2022-07-22 12:18:24,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:24,936 INFO L220 hiAutomatonCegarLoop]: Abstraction has 97 states and 299 transitions. [2022-07-22 12:18:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 299 transitions. [2022-07-22 12:18:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2022-07-22 12:18:24,941 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:18:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 202 transitions. [2022-07-22 12:18:24,942 INFO L242 hiAutomatonCegarLoop]: Abstraction has 65 states and 202 transitions. [2022-07-22 12:18:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:18:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:18:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:18:24,947 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:18:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:18:25,018 INFO L93 Difference]: Finished difference Result 132 states and 388 transitions. [2022-07-22 12:18:25,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 388 transitions. [2022-07-22 12:18:25,020 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 49 [2022-07-22 12:18:25,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 129 states and 379 transitions. [2022-07-22 12:18:25,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-07-22 12:18:25,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 12:18:25,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 379 transitions. [2022-07-22 12:18:25,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:25,023 INFO L220 hiAutomatonCegarLoop]: Abstraction has 129 states and 379 transitions. [2022-07-22 12:18:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 379 transitions. [2022-07-22 12:18:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2022-07-22 12:18:25,030 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:18:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 333 transitions. [2022-07-22 12:18:25,032 INFO L242 hiAutomatonCegarLoop]: Abstraction has 108 states and 333 transitions. [2022-07-22 12:18:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:18:25,033 INFO L425 stractBuchiCegarLoop]: Abstraction has 108 states and 333 transitions. [2022-07-22 12:18:25,033 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:18:25,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 333 transitions. [2022-07-22 12:18:25,034 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 41 [2022-07-22 12:18:25,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:25,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:25,035 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:18:25,035 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:25,036 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:18:25,036 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:18:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,037 INFO L85 PathProgramCache]: Analyzing trace with hash 422837294, now seen corresponding path program 1 times [2022-07-22 12:18:25,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160329858] [2022-07-22 12:18:25,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash 11959, now seen corresponding path program 2 times [2022-07-22 12:18:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343364917] [2022-07-22 12:18:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1675242588, now seen corresponding path program 2 times [2022-07-22 12:18:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499375481] [2022-07-22 12:18:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:25,123 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:25,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:25,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:25,123 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:25,123 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:25,123 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,123 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:25,123 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:25,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:18:25,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:25,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:25,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,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:18:25,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,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:18:25,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:18:25,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:18:25,190 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:25,190 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:25,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:25,192 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:18:25,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:25,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:25,208 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:18:25,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:25,253 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:18:25,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:25,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:25,270 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:18:25,406 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:25,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:25,409 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:25,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:25,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:25,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:25,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:25,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:25,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:25,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:18:25,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:25,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:25,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,491 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:25,492 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:25,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:25,493 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:18:25,494 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:18:25,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:25,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:25,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:25,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:25,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:25,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:25,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:25,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:25,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:25,520 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:25,538 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:25,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:25,547 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:18:25,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:25,549 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:25,549 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:25,550 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:18:25,551 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:18:25,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 12:18:25,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:25,609 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:25,619 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:18:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:25,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:25,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:25,652 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:25,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:25,664 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:18:25,665 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:18:25,665 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:18:25,713 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:18:25,713 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:18:25,714 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:18:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-07-22 12:18:25,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:18:25,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:25,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:18:25,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:25,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 12:18:25,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:25,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 574 transitions. [2022-07-22 12:18:25,718 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 44 [2022-07-22 12:18:25,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 178 states and 541 transitions. [2022-07-22 12:18:25,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-22 12:18:25,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2022-07-22 12:18:25,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 541 transitions. [2022-07-22 12:18:25,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:25,722 INFO L220 hiAutomatonCegarLoop]: Abstraction has 178 states and 541 transitions. [2022-07-22 12:18:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 541 transitions. [2022-07-22 12:18:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 111. [2022-07-22 12:18:25,729 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:18:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 342 transitions. [2022-07-22 12:18:25,730 INFO L242 hiAutomatonCegarLoop]: Abstraction has 111 states and 342 transitions. [2022-07-22 12:18:25,730 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 342 transitions. [2022-07-22 12:18:25,730 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:18:25,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 342 transitions. [2022-07-22 12:18:25,731 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 36 [2022-07-22 12:18:25,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:25,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:25,732 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:18:25,732 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:25,733 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:18:25,733 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:18:25,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash 422884175, now seen corresponding path program 1 times [2022-07-22 12:18:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215448064] [2022-07-22 12:18:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 2 times [2022-07-22 12:18:25,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133629320] [2022-07-22 12:18:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 224507924, now seen corresponding path program 1 times [2022-07-22 12:18:25,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816935642] [2022-07-22 12:18:25,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:25,796 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:18:25,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:18:25,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816935642] [2022-07-22 12:18:25,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816935642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:18:25,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:18:25,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:18:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663120833] [2022-07-22 12:18:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:18:25,811 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:25,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:25,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:25,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:25,812 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:25,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,812 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:25,812 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:25,812 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:18:25,812 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:25,812 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:25,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:25,870 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:25,871 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:25,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:25,872 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:18:25,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:25,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:25,888 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:18:25,930 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:18:25,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:25,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:25,932 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:18:25,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:25,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:25,950 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:18:26,100 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:26,102 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:18:26,102 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:26,103 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:26,103 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:26,103 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:26,103 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:26,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:26,103 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:26,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:18:26,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:26,103 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:26,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,170 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:26,170 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:26,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:26,171 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:18:26,173 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:18:26,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:26,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:26,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:26,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:26,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:26,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:26,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:26,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:26,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:26,191 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:18:26,191 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:26,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:26,199 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:18:26,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:26,210 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:26,210 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:26,210 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:18:26,223 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:18:26,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-22 12:18:26,245 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:26,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:26,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:26,286 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:26,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:26,287 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:18:26,287 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:18:26,288 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:18:26,316 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:18:26,316 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:18:26,317 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:18:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:18:26,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:18:26,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:26,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:18:26,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:26,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:18:26,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:26,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 352 transitions. [2022-07-22 12:18:26,320 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 35 [2022-07-22 12:18:26,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 352 transitions. [2022-07-22 12:18:26,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-07-22 12:18:26,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-07-22 12:18:26,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 352 transitions. [2022-07-22 12:18:26,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:26,323 INFO L220 hiAutomatonCegarLoop]: Abstraction has 116 states and 352 transitions. [2022-07-22 12:18:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 352 transitions. [2022-07-22 12:18:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-07-22 12:18:26,328 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:18:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 344 transitions. [2022-07-22 12:18:26,329 INFO L242 hiAutomatonCegarLoop]: Abstraction has 112 states and 344 transitions. [2022-07-22 12:18:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:18:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:18:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:18:26,330 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:18:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:18:26,386 INFO L93 Difference]: Finished difference Result 165 states and 486 transitions. [2022-07-22 12:18:26,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 486 transitions. [2022-07-22 12:18:26,389 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 46 [2022-07-22 12:18:26,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 156 states and 474 transitions. [2022-07-22 12:18:26,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-22 12:18:26,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-07-22 12:18:26,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 474 transitions. [2022-07-22 12:18:26,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:26,392 INFO L220 hiAutomatonCegarLoop]: Abstraction has 156 states and 474 transitions. [2022-07-22 12:18:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 474 transitions. [2022-07-22 12:18:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2022-07-22 12:18:26,397 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:18:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 344 transitions. [2022-07-22 12:18:26,398 INFO L242 hiAutomatonCegarLoop]: Abstraction has 113 states and 344 transitions. [2022-07-22 12:18:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:18:26,399 INFO L425 stractBuchiCegarLoop]: Abstraction has 113 states and 344 transitions. [2022-07-22 12:18:26,399 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:18:26,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 344 transitions. [2022-07-22 12:18:26,400 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 36 [2022-07-22 12:18:26,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:26,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:26,401 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:18:26,401 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:18:26,402 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#[L76-4, L40-1, thread2EXIT]don't care [2022-07-22 12:18:26,402 INFO L750 eck$LassoCheckResult]: Loop: 2792#[L76-4, L40-1, thread2EXIT]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#[L41-6, L76-4, thread2EXIT]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#[L41-6, L76-4, thread2EXIT]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#[L76-4, L40-1, thread2EXIT]don't care [2022-07-22 12:18:26,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash 422884177, now seen corresponding path program 1 times [2022-07-22 12:18:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:26,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925139679] [2022-07-22 12:18:26,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:26,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:26,415 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:26,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash 372241, now seen corresponding path program 1 times [2022-07-22 12:18:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:26,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474866020] [2022-07-22 12:18:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:26,433 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:26,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1003780289, now seen corresponding path program 1 times [2022-07-22 12:18:26,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:26,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811536994] [2022-07-22 12:18:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:26,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:26,467 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:18:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:18:26,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811536994] [2022-07-22 12:18:26,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811536994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:18:26,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:18:26,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:18:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338336871] [2022-07-22 12:18:26,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:18:26,511 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:26,511 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:26,511 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:26,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:26,512 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:26,512 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,512 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:26,512 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:26,512 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:18:26,512 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:26,512 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:26,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:26,599 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:26,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:26,600 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:18:26,600 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:18:26,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:26,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:26,633 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:18:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:26,634 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:18:26,635 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:18:26,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:26,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:26,800 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:26,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:26,802 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:26,802 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:26,803 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:26,803 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:26,803 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:26,803 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,803 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:26,803 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:26,803 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:18:26,803 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:26,803 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:26,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,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:18:26,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,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:18:26,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:18:26,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,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:18:26,902 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:26,902 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:26,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:26,906 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:18:26,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:18:26,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:26,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:26,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:26,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:26,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:26,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:26,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:26,927 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:18:26,935 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:26,941 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:26,942 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:26,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:26,944 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:18:26,951 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:26,951 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:26,951 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:26,951 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:18:26,966 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:18:26,988 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:18:26,989 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:27,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:27,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:27,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:27,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:27,056 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:18:27,057 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:18:27,058 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:18:27,103 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:18:27,103 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:18:27,106 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:18:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-07-22 12:18:27,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2022-07-22 12:18:27,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:27,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2022-07-22 12:18:27,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:27,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2022-07-22 12:18:27,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:27,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 429 transitions. [2022-07-22 12:18:27,112 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 37 [2022-07-22 12:18:27,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 146 states and 398 transitions. [2022-07-22 12:18:27,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-07-22 12:18:27,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2022-07-22 12:18:27,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 398 transitions. [2022-07-22 12:18:27,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:27,117 INFO L220 hiAutomatonCegarLoop]: Abstraction has 146 states and 398 transitions. [2022-07-22 12:18:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 398 transitions. [2022-07-22 12:18:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2022-07-22 12:18:27,121 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:18:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 343 transitions. [2022-07-22 12:18:27,121 INFO L242 hiAutomatonCegarLoop]: Abstraction has 115 states and 343 transitions. [2022-07-22 12:18:27,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:18:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:18:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:18:27,122 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:18:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:18:27,178 INFO L93 Difference]: Finished difference Result 185 states and 552 transitions. [2022-07-22 12:18:27,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 552 transitions. [2022-07-22 12:18:27,181 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 53 [2022-07-22 12:18:27,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 169 states and 512 transitions. [2022-07-22 12:18:27,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2022-07-22 12:18:27,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2022-07-22 12:18:27,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 512 transitions. [2022-07-22 12:18:27,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:27,186 INFO L220 hiAutomatonCegarLoop]: Abstraction has 169 states and 512 transitions. [2022-07-22 12:18:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 512 transitions. [2022-07-22 12:18:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 140. [2022-07-22 12:18:27,190 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:18:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 438 transitions. [2022-07-22 12:18:27,191 INFO L242 hiAutomatonCegarLoop]: Abstraction has 140 states and 438 transitions. [2022-07-22 12:18:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:18:27,193 INFO L425 stractBuchiCegarLoop]: Abstraction has 140 states and 438 transitions. [2022-07-22 12:18:27,193 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:18:27,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 438 transitions. [2022-07-22 12:18:27,195 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 47 [2022-07-22 12:18:27,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:27,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:27,195 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:18:27,195 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:27,196 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:18:27,197 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:18:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash 223079490, now seen corresponding path program 1 times [2022-07-22 12:18:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:27,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503727585] [2022-07-22 12:18:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,217 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:27,253 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 4 times [2022-07-22 12:18:27,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704163520] [2022-07-22 12:18:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:27,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:27,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1674470000, now seen corresponding path program 2 times [2022-07-22 12:18:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:27,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231957371] [2022-07-22 12:18:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:27,299 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:27,299 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:27,300 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:27,300 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:27,300 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:27,300 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:27,300 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:27,300 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:27,300 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:18:27,300 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:27,300 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:27,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:18:27,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,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:18:27,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,335 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:18:27,368 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:27,368 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:27,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:27,369 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:18:27,380 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:18:27,389 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:18:27,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:27,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:27,464 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:18:27,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:27,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:27,470 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:18:27,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:27,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:27,487 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:18:27,627 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:27,629 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:18:27,630 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:27,630 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:27,630 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:27,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:27,630 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:27,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:27,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:27,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:27,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:18:27,631 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:27,631 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:27,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,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:18:27,706 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:27,706 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:27,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:27,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:27,708 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:18:27,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:27,723 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:18:27,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:27,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:27,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:27,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:27,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:27,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:27,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:27,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:27,734 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:27,734 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:27,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:27,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:27,736 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:18:27,737 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:18:27,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:27,738 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:27,738 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:27,738 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:18:27,760 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:18:27,761 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:27,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:27,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:27,807 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:27,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:27,808 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:18:27,809 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:18:27,809 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:18:27,848 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:18:27,848 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:18:27,849 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:18:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:18:27,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:18:27,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:27,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:27,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:27,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:18:27,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:27,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 805 transitions. [2022-07-22 12:18:27,855 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 67 [2022-07-22 12:18:27,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 263 states and 797 transitions. [2022-07-22 12:18:27,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-07-22 12:18:27,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2022-07-22 12:18:27,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 797 transitions. [2022-07-22 12:18:27,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:27,860 INFO L220 hiAutomatonCegarLoop]: Abstraction has 263 states and 797 transitions. [2022-07-22 12:18:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 797 transitions. [2022-07-22 12:18:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 160. [2022-07-22 12:18:27,867 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:18:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 499 transitions. [2022-07-22 12:18:27,868 INFO L242 hiAutomatonCegarLoop]: Abstraction has 160 states and 499 transitions. [2022-07-22 12:18:27,868 INFO L425 stractBuchiCegarLoop]: Abstraction has 160 states and 499 transitions. [2022-07-22 12:18:27,868 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:18:27,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 499 transitions. [2022-07-22 12:18:27,870 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 50 [2022-07-22 12:18:27,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:27,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:27,871 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:18:27,871 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:27,872 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:18:27,872 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:18:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash 223079446, now seen corresponding path program 1 times [2022-07-22 12:18:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:27,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835620453] [2022-07-22 12:18:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 3 times [2022-07-22 12:18:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:27,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651999129] [2022-07-22 12:18:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,907 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1674471379, now seen corresponding path program 1 times [2022-07-22 12:18:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:27,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086013908] [2022-07-22 12:18:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:27,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:27,950 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:27,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:27,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:27,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:27,950 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:27,951 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:27,951 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:27,951 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:27,951 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:18:27,951 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:27,951 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:27,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,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:18:27,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:18:27,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,008 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:28,009 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:28,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,010 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:18:28,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:28,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:28,021 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:18:28,030 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:28,030 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:18:28,056 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:18:28,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,058 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:18:28,058 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:18:28,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:28,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:28,081 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:28,081 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:18:28,112 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:18:28,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,113 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:18:28,114 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:18:28,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:28,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:28,144 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:18:28,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,145 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:18:28,152 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:18:28,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:28,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:28,310 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:28,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,314 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:28,314 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:28,314 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:28,314 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:28,314 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:28,314 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,315 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:28,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:28,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:18:28,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:28,315 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:28,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,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:18:28,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,376 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:28,376 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:28,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,378 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:18:28,381 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:18:28,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:28,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:28,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:28,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:28,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,439 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:18:28,440 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:18:28,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:28,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:28,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:28,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:28,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,498 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:18:28,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,499 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:18:28,501 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:18:28,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:28,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:28,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:28,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:28,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:28,525 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:28,525 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:28,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,526 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:18:28,527 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:18:28,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:28,527 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:28,527 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:28,527 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:18:28,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-22 12:18:28,550 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:28,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:28,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:28,602 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:28,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:28,603 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:18:28,603 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:18:28,603 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:18:28,646 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:18:28,646 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:18:28,647 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:18:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:18:28,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:18:28,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:28,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:28,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:28,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:18:28,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:28,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 652 transitions. [2022-07-22 12:18:28,654 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 47 [2022-07-22 12:18:28,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 213 states and 640 transitions. [2022-07-22 12:18:28,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2022-07-22 12:18:28,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2022-07-22 12:18:28,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 640 transitions. [2022-07-22 12:18:28,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:28,658 INFO L220 hiAutomatonCegarLoop]: Abstraction has 213 states and 640 transitions. [2022-07-22 12:18:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 640 transitions. [2022-07-22 12:18:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 178. [2022-07-22 12:18:28,664 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:18:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 558 transitions. [2022-07-22 12:18:28,665 INFO L242 hiAutomatonCegarLoop]: Abstraction has 178 states and 558 transitions. [2022-07-22 12:18:28,665 INFO L425 stractBuchiCegarLoop]: Abstraction has 178 states and 558 transitions. [2022-07-22 12:18:28,666 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:18:28,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 558 transitions. [2022-07-22 12:18:28,668 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 47 [2022-07-22 12:18:28,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:28,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:28,668 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:18:28,668 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:28,669 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:18:28,669 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:18:28,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash 224507025, now seen corresponding path program 1 times [2022-07-22 12:18:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:28,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489461388] [2022-07-22 12:18:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:28,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:28,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:28,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:28,702 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 4 times [2022-07-22 12:18:28,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:28,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759366357] [2022-07-22 12:18:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:28,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:28,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1630216430, now seen corresponding path program 2 times [2022-07-22 12:18:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:28,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201971055] [2022-07-22 12:18:28,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:28,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:28,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:28,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:28,783 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:28,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:28,783 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:28,783 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:28,783 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:28,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:28,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:28,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:18:28,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:28,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:28,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:18:28,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,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:18:28,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,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:18:28,843 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:28,843 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:28,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,845 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:18:28,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:28,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:28,864 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:18:28,873 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:28,873 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:18:28,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,907 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:18:28,908 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:18:28,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:28,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:28,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,940 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:18:28,941 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:18:28,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:28,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:29,091 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:29,094 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:18:29,094 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:29,094 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:29,094 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:29,094 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:29,094 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:29,094 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,094 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:29,094 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:29,095 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:18:29,095 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:29,095 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:29,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,159 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:29,160 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:29,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,161 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:18:29,162 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:18:29,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:29,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:29,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:29,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:29,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:29,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:29,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:29,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:29,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:29,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-22 12:18:29,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,197 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:18:29,198 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:18:29,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:29,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:29,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:29,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:29,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:29,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:29,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:29,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:29,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:29,211 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:29,211 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:29,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,212 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:18:29,215 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:18:29,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:29,215 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:29,215 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:29,215 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:18:29,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-07-22 12:18:29,238 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:29,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:29,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:29,283 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:29,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:29,284 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:18:29,285 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:18:29,285 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:18:29,327 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:18:29,328 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:18:29,328 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:18:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:18:29,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:18:29,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:29,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:29,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:29,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:18:29,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:29,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 941 transitions. [2022-07-22 12:18:29,336 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 51 [2022-07-22 12:18:29,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 292 states and 929 transitions. [2022-07-22 12:18:29,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2022-07-22 12:18:29,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-07-22 12:18:29,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 929 transitions. [2022-07-22 12:18:29,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:29,342 INFO L220 hiAutomatonCegarLoop]: Abstraction has 292 states and 929 transitions. [2022-07-22 12:18:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 929 transitions. [2022-07-22 12:18:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 217. [2022-07-22 12:18:29,350 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:18:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 696 transitions. [2022-07-22 12:18:29,351 INFO L242 hiAutomatonCegarLoop]: Abstraction has 217 states and 696 transitions. [2022-07-22 12:18:29,351 INFO L425 stractBuchiCegarLoop]: Abstraction has 217 states and 696 transitions. [2022-07-22 12:18:29,351 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 12:18:29,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 696 transitions. [2022-07-22 12:18:29,354 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 49 [2022-07-22 12:18:29,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:29,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:29,354 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:18:29,354 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:29,355 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:18:29,355 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:18:29,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash 224507003, now seen corresponding path program 1 times [2022-07-22 12:18:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:29,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382652120] [2022-07-22 12:18:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:29,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash 11959, now seen corresponding path program 3 times [2022-07-22 12:18:29,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:29,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828701327] [2022-07-22 12:18:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:29,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:29,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1002876081, now seen corresponding path program 2 times [2022-07-22 12:18:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:29,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299602299] [2022-07-22 12:18:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:29,493 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:29,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:29,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:29,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:29,494 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:29,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:29,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:29,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:18:29,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:29,494 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:29,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:18:29,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:18:29,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:18:29,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:18:29,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:29,514 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:18:29,571 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:29,572 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,573 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:18:29,580 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:18:29,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:29,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:29,601 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:18:29,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:29,608 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:18:29,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-22 12:18:29,634 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:18:29,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,635 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:18:29,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:29,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:29,640 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:18:29,645 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:29,646 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:18:29,667 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:18:29,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,668 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:18:29,670 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:18:29,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:29,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:29,684 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:29,684 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:18:29,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-22 12:18:29,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,707 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:18:29,707 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:18:29,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:29,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:29,722 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:29,722 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:18:29,744 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:18:29,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,745 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:18:29,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:29,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:29,746 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:18:29,780 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:29,780 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:18:29,814 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:18:29,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,816 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:18:29,818 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:29,818 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:29,832 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:18:29,837 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:29,838 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:18:29,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-22 12:18:29,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,868 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:18:29,869 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:18:29,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:29,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:29,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:29,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,899 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:18:29,900 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:18:29,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:29,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:30,030 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:30,033 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:18:30,033 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:30,033 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:30,033 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:30,033 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:30,033 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:30,033 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,033 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:30,034 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:30,034 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:18:30,034 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:30,034 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:30,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:18:30,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,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:18:30,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:18:30,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:18:30,102 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:30,103 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,105 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:18:30,110 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:18:30,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:30,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:30,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:30,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:30,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:30,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:30,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:30,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:30,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:30,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,146 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:18:30,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:18:30,150 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:18:30,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:30,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:30,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:30,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:30,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:30,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:30,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:30,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:30,178 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:18:30,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,181 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:18:30,185 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:18:30,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:30,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:30,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:30,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:30,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:30,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:30,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:30,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:30,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-22 12:18:30,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,223 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:18:30,224 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:18:30,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:30,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:30,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:30,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:30,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:30,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:30,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:30,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:30,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-22 12:18:30,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,261 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:18:30,262 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:18:30,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:30,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:30,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:30,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:30,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:30,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:30,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:30,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:30,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:30,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-22 12:18:30,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,294 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:18:30,295 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:18:30,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:18:30,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:30,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:30,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:30,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:30,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:30,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:30,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:30,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,344 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:18:30,345 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:18:30,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:30,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:30,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:30,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:30,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:30,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:30,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:30,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:30,355 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:30,358 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:30,359 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:30,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,360 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:18:30,360 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:18:30,361 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:30,361 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:30,361 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:30,361 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:18:30,383 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:18:30,384 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:30,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:30,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:30,428 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:30,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:30,441 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:18:30,442 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:18:30,442 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:18:30,511 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:18:30,517 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:18:30,517 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:18:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-07-22 12:18:30,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:18:30,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:30,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:18:30,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:30,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-22 12:18:30,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:30,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 1753 transitions. [2022-07-22 12:18:30,533 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 77 [2022-07-22 12:18:30,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 438 states and 1417 transitions. [2022-07-22 12:18:30,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2022-07-22 12:18:30,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2022-07-22 12:18:30,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 1417 transitions. [2022-07-22 12:18:30,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:30,547 INFO L220 hiAutomatonCegarLoop]: Abstraction has 438 states and 1417 transitions. [2022-07-22 12:18:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 1417 transitions. [2022-07-22 12:18:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 264. [2022-07-22 12:18:30,559 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:18:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 875 transitions. [2022-07-22 12:18:30,561 INFO L242 hiAutomatonCegarLoop]: Abstraction has 264 states and 875 transitions. [2022-07-22 12:18:30,561 INFO L425 stractBuchiCegarLoop]: Abstraction has 264 states and 875 transitions. [2022-07-22 12:18:30,561 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 12:18:30,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 875 transitions. [2022-07-22 12:18:30,564 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 53 [2022-07-22 12:18:30,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:30,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:30,565 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-22 12:18:30,565 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:30,566 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:18:30,566 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:18:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1674141710, now seen corresponding path program 3 times [2022-07-22 12:18:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:30,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839269666] [2022-07-22 12:18:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:30,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:30,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:30,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 433, now seen corresponding path program 5 times [2022-07-22 12:18:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:30,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490459403] [2022-07-22 12:18:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:30,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:30,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash -358785056, now seen corresponding path program 4 times [2022-07-22 12:18:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:30,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794591467] [2022-07-22 12:18:30,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:30,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:30,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:30,639 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:30,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:30,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:30,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:30,640 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:30,640 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,640 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:30,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:30,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:18:30,640 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:30,640 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:30,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,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:18:30,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,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:18:30,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:30,701 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:30,701 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,703 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:18:30,704 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:18:30,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:30,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:30,718 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:30,718 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:18:30,740 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:18:30,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,742 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:18:30,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:30,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:30,744 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:18:30,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:30,752 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:18:30,774 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:18:30,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,776 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:18:30,776 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:18:30,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:30,777 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:30,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-07-22 12:18:30,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,807 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:18:30,808 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:18:30,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:30,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:30,830 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:30,831 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:18:30,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-22 12:18:30,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,854 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:18:30,856 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:18:30,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:30,856 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:30,864 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:30,865 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:18:30,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-22 12:18:30,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,889 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:18:30,890 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:18:30,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:30,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:30,904 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:30,904 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:18:30,926 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:18:30,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,928 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:18:30,929 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:18:30,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:30,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:30,961 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:18:30,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:30,962 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:18:30,963 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:18:30,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:30,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:31,115 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:31,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:31,118 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:31,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:31,118 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:31,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:31,118 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:31,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:31,119 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:31,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:18:31,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:31,119 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:31,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,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:18:31,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,187 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:31,187 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:31,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,188 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:18:31,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:18:31,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:31,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:31,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:31,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:31,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:31,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:31,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:31,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:31,241 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:18:31,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,243 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:18:31,243 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:18:31,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:31,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:31,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:31,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:31,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:31,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:31,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:31,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:31,276 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:18:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,277 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:18:31,278 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:18:31,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:31,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:31,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:31,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:31,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:31,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:31,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:31,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:31,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:31,309 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:18:31,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,310 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:18:31,311 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:18:31,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:31,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:31,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:31,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:31,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:31,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:31,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:31,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:31,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:31,342 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:18:31,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,343 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:18:31,344 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:18:31,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:18:31,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:31,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:31,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:31,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:31,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:31,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:31,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:31,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:31,374 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:18:31,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,376 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:18:31,377 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:18:31,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:31,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:31,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:31,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:31,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:31,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:31,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:31,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:31,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-22 12:18:31,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,411 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:18:31,412 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:18:31,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:31,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:31,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:31,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:31,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:31,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:31,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:31,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:31,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:31,425 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:18:31,425 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:18:31,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,427 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:18:31,428 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:18:31,428 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:31,428 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:31,428 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:31,428 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:18:31,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:31,451 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:31,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:31,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:31,501 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:31,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:31,501 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:18:31,502 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:18:31,502 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:18:31,542 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:18:31,542 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:18:31,543 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:18:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:18:31,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:31,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:31,544 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:31,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:31,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:31,580 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:31,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:31,581 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:18:31,581 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:18:31,582 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:18:31,615 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:18:31,615 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:18:31,616 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:18:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:18:31,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:31,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:31,617 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:31,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:31,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:31,651 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:31,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:31,652 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:18:31,652 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:18:31,652 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:18:31,690 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:18:31,690 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:18:31,691 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:18:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-07-22 12:18:31,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:31,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:31,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:18:31,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:31,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:18:31,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:31,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 1146 transitions. [2022-07-22 12:18:31,698 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 64 [2022-07-22 12:18:31,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 330 states and 1043 transitions. [2022-07-22 12:18:31,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2022-07-22 12:18:31,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2022-07-22 12:18:31,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 1043 transitions. [2022-07-22 12:18:31,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:31,704 INFO L220 hiAutomatonCegarLoop]: Abstraction has 330 states and 1043 transitions. [2022-07-22 12:18:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 1043 transitions. [2022-07-22 12:18:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2022-07-22 12:18:31,717 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:18:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 855 transitions. [2022-07-22 12:18:31,766 INFO L242 hiAutomatonCegarLoop]: Abstraction has 268 states and 855 transitions. [2022-07-22 12:18:31,766 INFO L425 stractBuchiCegarLoop]: Abstraction has 268 states and 855 transitions. [2022-07-22 12:18:31,766 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 12:18:31,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 855 transitions. [2022-07-22 12:18:31,773 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 55 [2022-07-22 12:18:31,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:31,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:31,774 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:18:31,774 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:31,775 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:18:31,775 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:18:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1674470465, now seen corresponding path program 1 times [2022-07-22 12:18:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:31,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299489767] [2022-07-22 12:18:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:31,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:31,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash 13360, now seen corresponding path program 1 times [2022-07-22 12:18:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:31,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140958251] [2022-07-22 12:18:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:31,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:31,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1446631534, now seen corresponding path program 2 times [2022-07-22 12:18:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:31,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837309984] [2022-07-22 12:18:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:31,832 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:18:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:31,856 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:31,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:31,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-22 12:18:31,904 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:31,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:31,904 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:31,904 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:31,905 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:31,905 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:31,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:31,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration14_Loop [2022-07-22 12:18:31,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:31,905 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:31,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,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:18:31,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:31,987 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:31,988 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:31,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:31,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:31,989 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:18:31,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:31,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:32,005 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:18:32,050 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:18:32,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:32,052 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:18:32,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:32,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:32,074 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:18:32,266 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:32,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-22 12:18:32,270 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:32,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:32,271 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:32,271 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:32,271 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:32,271 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:32,271 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:32,271 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:32,271 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration14_Loop [2022-07-22 12:18:32,271 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:32,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:32,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:18:32,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,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:18:32,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,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:18:32,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,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:18:32,367 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:32,367 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:32,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:32,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:32,368 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:18:32,369 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:18:32,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:32,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:32,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:32,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:32,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:32,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:32,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:32,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:32,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:32,383 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:32,383 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:32,384 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:18:32,385 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:18:32,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:32,385 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:32,385 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:32,385 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:18:32,406 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:18:32,407 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:32,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:32,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:32,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:32,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:32,487 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:18:32,488 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:18:32,488 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:18:32,538 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:18:32,538 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:18:32,539 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:18:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:18:32,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:18:32,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:32,540 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:32,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:32,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:32,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:32,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:32,601 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:18:32,602 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:18:32,602 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:18:32,673 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:18:32,674 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:18:32,675 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:18:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-22 12:18:32,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:18:32,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:32,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:18:32,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:32,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:18:32,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:32,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 2035 transitions. [2022-07-22 12:18:32,695 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 93 [2022-07-22 12:18:32,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 618 states and 1881 transitions. [2022-07-22 12:18:32,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2022-07-22 12:18:32,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2022-07-22 12:18:32,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 618 states and 1881 transitions. [2022-07-22 12:18:32,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:32,705 INFO L220 hiAutomatonCegarLoop]: Abstraction has 618 states and 1881 transitions. [2022-07-22 12:18:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states and 1881 transitions. [2022-07-22 12:18:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 369. [2022-07-22 12:18:32,724 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:18:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1205 transitions. [2022-07-22 12:18:32,727 INFO L242 hiAutomatonCegarLoop]: Abstraction has 369 states and 1205 transitions. [2022-07-22 12:18:32,727 INFO L425 stractBuchiCegarLoop]: Abstraction has 369 states and 1205 transitions. [2022-07-22 12:18:32,727 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 12:18:32,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 1205 transitions. [2022-07-22 12:18:32,732 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 57 [2022-07-22 12:18:32,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:32,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:32,733 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-22 12:18:32,733 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:32,734 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:18:32,734 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:18:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1674407966, now seen corresponding path program 3 times [2022-07-22 12:18:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:32,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714944263] [2022-07-22 12:18:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:32,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:32,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:32,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash 12619, now seen corresponding path program 4 times [2022-07-22 12:18:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:32,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892410888] [2022-07-22 12:18:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:32,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:32,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:32,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:32,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1506692332, now seen corresponding path program 4 times [2022-07-22 12:18:32,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:32,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254060473] [2022-07-22 12:18:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:32,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:32,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:32,827 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:32,827 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:32,827 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:32,827 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:32,828 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:32,828 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:32,828 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:32,828 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:32,828 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration15_Loop [2022-07-22 12:18:32,828 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:32,829 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:32,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,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:18:32,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:18:32,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:32,891 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:32,892 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:32,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:32,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:32,893 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:18:32,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:32,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:32,905 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:18:32,923 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:32,923 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:18:32,962 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:18:32,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:32,964 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:18:32,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:32,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:32,969 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:18:32,991 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:32,991 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:18:33,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:33,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:33,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:33,028 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:18:33,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:33,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:33,034 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:18:33,053 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:33,053 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:18:33,089 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:18:33,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:33,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:33,091 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:18:33,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:33,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:33,108 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:18:33,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:33,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:33,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:33,154 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:18:33,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:33,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:33,172 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:18:33,629 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:33,632 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:18:33,632 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:33,632 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:33,632 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:33,632 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:33,633 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:33,633 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:33,633 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:33,633 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:33,633 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration15_Loop [2022-07-22 12:18:33,633 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:33,633 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:33,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,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:18:33,702 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:33,702 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:33,703 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:18:33,706 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:18:33,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:33,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:33,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:33,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:33,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:33,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:33,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:33,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:33,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:33,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:33,742 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:18:33,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:33,746 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:18:33,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:33,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:33,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:33,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:33,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:33,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:33,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:33,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-07-22 12:18:33,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:33,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:33,782 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:18:33,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:33,789 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:18:33,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:33,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:33,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:33,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:33,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:33,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:33,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:33,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:33,798 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:33,799 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:33,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:33,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:33,800 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:18:33,801 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:18:33,801 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:33,801 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:33,801 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:33,801 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:18:33,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:33,824 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:33,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:33,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:33,869 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:33,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:33,880 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:18:33,881 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:18:33,881 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:18:33,951 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:18:33,951 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:18:33,952 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:18:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-07-22 12:18:33,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:18:33,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:33,952 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:33,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:33,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:33,996 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:33,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:34,004 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:18:34,004 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:18:34,005 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:18:34,058 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:18:34,059 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:18:34,059 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:18:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-07-22 12:18:34,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:18:34,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:34,060 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:34,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:34,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:34,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:34,099 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:34,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:34,108 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:18:34,108 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:18:34,109 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:18:34,194 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:18:34,195 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:18:34,195 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:18:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-07-22 12:18:34,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:18:34,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:34,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:18:34,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:34,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:18:34,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:34,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 1872 transitions. [2022-07-22 12:18:34,204 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 69 [2022-07-22 12:18:34,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 545 states and 1667 transitions. [2022-07-22 12:18:34,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2022-07-22 12:18:34,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2022-07-22 12:18:34,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 545 states and 1667 transitions. [2022-07-22 12:18:34,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:34,212 INFO L220 hiAutomatonCegarLoop]: Abstraction has 545 states and 1667 transitions. [2022-07-22 12:18:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states and 1667 transitions. [2022-07-22 12:18:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 430. [2022-07-22 12:18:34,226 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:18:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1408 transitions. [2022-07-22 12:18:34,228 INFO L242 hiAutomatonCegarLoop]: Abstraction has 430 states and 1408 transitions. [2022-07-22 12:18:34,228 INFO L425 stractBuchiCegarLoop]: Abstraction has 430 states and 1408 transitions. [2022-07-22 12:18:34,228 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 12:18:34,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 430 states and 1408 transitions. [2022-07-22 12:18:34,232 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 57 [2022-07-22 12:18:34,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:34,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:34,233 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-22 12:18:34,233 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:34,234 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:18:34,234 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:18:34,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1630175510, now seen corresponding path program 3 times [2022-07-22 12:18:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:34,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784473914] [2022-07-22 12:18:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:34,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:34,251 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:18:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:34,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:34,286 INFO L85 PathProgramCache]: Analyzing trace with hash 418, now seen corresponding path program 5 times [2022-07-22 12:18:34,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:34,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595165040] [2022-07-22 12:18:34,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:34,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:34,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:34,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:34,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1004167129, now seen corresponding path program 4 times [2022-07-22 12:18:34,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:34,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632139349] [2022-07-22 12:18:34,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:34,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:34,314 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:18:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:34,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:34,337 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:34,337 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:34,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:34,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:34,337 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:34,338 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,338 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:34,338 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:34,338 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration16_Loop [2022-07-22 12:18:34,338 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:34,338 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:34,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:18:34,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:18:34,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:34,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:34,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:18:34,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:18:34,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:34,395 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:34,395 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:34,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,399 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:18:34,402 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:18:34,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:34,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:34,414 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:34,415 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:18:34,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-07-22 12:18:34,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,439 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:18:34,439 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:18:34,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:34,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:34,454 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:34,454 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:18:34,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2022-07-22 12:18:34,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,477 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:18:34,480 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:18:34,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:34,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:34,489 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:34,490 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:18:34,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-07-22 12:18:34,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,512 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:18:34,513 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:18:34,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:34,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:34,528 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:34,528 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:18:34,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-07-22 12:18:34,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,551 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:18:34,551 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:18:34,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:34,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:34,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:34,566 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:18:34,588 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:18:34,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,589 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:18:34,590 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:18:34,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:34,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:34,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-07-22 12:18:34,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,622 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:18:34,623 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:18:34,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:34,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:34,772 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:34,774 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:18:34,774 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:34,775 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:34,775 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:34,775 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:34,775 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:34,775 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,775 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:34,775 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:34,775 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration16_Loop [2022-07-22 12:18:34,775 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:34,775 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:34,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:34,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:34,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:34,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:18:34,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:18:34,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:18:34,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:18:34,846 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:34,847 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:34,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,848 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:18:34,852 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:18:34,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:34,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:34,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:34,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:34,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,884 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:18:34,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,885 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:18:34,886 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:18:34,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,919 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:18:34,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,920 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:18:34,921 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:18:34,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:34,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:34,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:34,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:34,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-07-22 12:18:34,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,955 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:18:34,956 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:18:34,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:34,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-07-22 12:18:34,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,993 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:18:34,994 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:18:34,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:35,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,028 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:18:35,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,029 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:18:35,030 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:18:35,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:35,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:35,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:35,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:35,041 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:35,045 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:35,045 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:35,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,047 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:18:35,048 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:18:35,048 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:35,048 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:35,048 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:35,049 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:18:35,070 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:18:35,070 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:35,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:35,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:35,115 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:35,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:35,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:18:35,116 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:18:35,116 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:18:35,161 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:18:35,162 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:18:35,162 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:18:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:18:35,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:35,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:35,163 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:35,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:35,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:35,210 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:35,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:35,211 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:18:35,212 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:18:35,212 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:18:35,254 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:18:35,255 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:18:35,255 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:18:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:18:35,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:35,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:35,256 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:35,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:35,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:35,299 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:35,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:35,300 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:18:35,300 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:18:35,301 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:18:35,343 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:18:35,344 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:18:35,344 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:18:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-07-22 12:18:35,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:18:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:35,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:18:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:35,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:18:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:35,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 603 states and 1932 transitions. [2022-07-22 12:18:35,354 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 73 [2022-07-22 12:18:35,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 603 states to 537 states and 1637 transitions. [2022-07-22 12:18:35,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2022-07-22 12:18:35,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2022-07-22 12:18:35,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 537 states and 1637 transitions. [2022-07-22 12:18:35,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:35,361 INFO L220 hiAutomatonCegarLoop]: Abstraction has 537 states and 1637 transitions. [2022-07-22 12:18:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states and 1637 transitions. [2022-07-22 12:18:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 367. [2022-07-22 12:18:35,376 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:18:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1149 transitions. [2022-07-22 12:18:35,377 INFO L242 hiAutomatonCegarLoop]: Abstraction has 367 states and 1149 transitions. [2022-07-22 12:18:35,377 INFO L425 stractBuchiCegarLoop]: Abstraction has 367 states and 1149 transitions. [2022-07-22 12:18:35,378 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-22 12:18:35,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 1149 transitions. [2022-07-22 12:18:35,381 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2022-07-22 12:18:35,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:35,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:35,382 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:18:35,382 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-07-22 12:18:35,383 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:18:35,383 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:18:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1674471162, now seen corresponding path program 1 times [2022-07-22 12:18:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:35,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663812185] [2022-07-22 12:18:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:35,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash 11525443, now seen corresponding path program 1 times [2022-07-22 12:18:35,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:35,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443029033] [2022-07-22 12:18:35,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2001507384, now seen corresponding path program 2 times [2022-07-22 12:18:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048899033] [2022-07-22 12:18:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:35,490 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:35,491 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:35,491 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:35,491 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:35,491 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:35,491 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,491 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:35,491 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:35,491 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration17_Loop [2022-07-22 12:18:35,491 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:35,491 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:35,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:18:35,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:18:35,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:18:35,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:35,598 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,599 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:18:35,600 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:18:35,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:35,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:35,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:35,608 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:18:35,631 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:18:35,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,632 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:18:35,633 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:18:35,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:35,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:35,641 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:35,642 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:18:35,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-07-22 12:18:35,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,664 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:18:35,668 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:18:35,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:35,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:35,699 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:18:35,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,700 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:18:35,701 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:18:35,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:35,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:35,959 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:35,962 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:18:35,962 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:35,962 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:35,962 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:35,962 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:35,962 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:35,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:35,963 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:35,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration17_Loop [2022-07-22 12:18:35,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:35,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:35,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:18:35,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:35,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:36,063 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:36,063 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:36,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:36,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:36,065 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:18:36,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:36,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:36,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:36,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:36,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:36,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:36,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:36,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:36,088 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:18:36,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:36,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:36,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:36,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:36,135 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:18:36,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:36,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:36,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:36,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:36,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:36,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:36,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:36,151 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:18:36,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:36,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:36,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:36,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:36,201 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:18:36,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:36,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:36,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:36,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:36,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:36,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:36,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:36,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:36,217 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:18:36,225 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:36,229 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:18:36,230 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:18:36,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:36,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:36,231 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:18:36,233 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:36,233 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:36,233 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:36,234 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:18:36,249 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:18:36,273 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:18:36,273 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:36,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:36,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:36,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:36,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:36,391 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:18:36,413 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:18:36,414 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:18:36,414 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:18:36,461 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:18:36,468 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:18:36,468 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:18:36,469 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:18:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-22 12:18:36,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:18:36,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:36,470 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:18:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:36,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:36,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:36,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:36,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:36,542 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:18:36,543 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:18:36,543 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:18:36,627 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:18:36,628 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:18:36,628 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:18:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-07-22 12:18:36,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:18:36,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:36,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-22 12:18:36,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:36,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 7 letters. Loop has 8 letters. [2022-07-22 12:18:36,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:36,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 968 states and 3002 transitions. [2022-07-22 12:18:36,642 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 84 [2022-07-22 12:18:36,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 968 states to 863 states and 2671 transitions. [2022-07-22 12:18:36,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2022-07-22 12:18:36,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 225 [2022-07-22 12:18:36,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 2671 transitions. [2022-07-22 12:18:36,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:36,655 INFO L220 hiAutomatonCegarLoop]: Abstraction has 863 states and 2671 transitions. [2022-07-22 12:18:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 2671 transitions. [2022-07-22 12:18:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 572. [2022-07-22 12:18:36,675 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:18:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1814 transitions. [2022-07-22 12:18:36,678 INFO L242 hiAutomatonCegarLoop]: Abstraction has 572 states and 1814 transitions. [2022-07-22 12:18:36,678 INFO L425 stractBuchiCegarLoop]: Abstraction has 572 states and 1814 transitions. [2022-07-22 12:18:36,679 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-22 12:18:36,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 572 states and 1814 transitions. [2022-07-22 12:18:36,684 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 75 [2022-07-22 12:18:36,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:36,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:36,685 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:18:36,685 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:18:36,686 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:18:36,686 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:18:36,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -358723022, now seen corresponding path program 1 times [2022-07-22 12:18:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:36,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817552765] [2022-07-22 12:18:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:36,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:36,710 INFO L85 PathProgramCache]: Analyzing trace with hash 427771, now seen corresponding path program 2 times [2022-07-22 12:18:36,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:36,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513949891] [2022-07-22 12:18:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:36,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,714 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:36,718 INFO L85 PathProgramCache]: Analyzing trace with hash -838517974, now seen corresponding path program 2 times [2022-07-22 12:18:36,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:36,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300324294] [2022-07-22 12:18:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:36,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:36,773 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:36,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:36,773 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:36,773 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:36,773 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:36,773 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:36,773 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:36,773 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:36,773 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration18_Loop [2022-07-22 12:18:36,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:36,774 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:36,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:36,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:36,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:36,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:36,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:36,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:18:36,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:18:36,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:36,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:18:36,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:18:36,854 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:36,854 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:36,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:36,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:36,855 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:18:36,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:36,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:36,877 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:18:36,884 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:36,884 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:18:36,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:36,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:36,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:36,920 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:18:36,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:36,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:36,937 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:18:36,941 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:18:36,941 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:18:36,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:36,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:36,979 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:18:36,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:36,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:36,992 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:18:37,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:37,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:37,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:37,039 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:18:37,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:37,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:37,060 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:18:37,561 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:37,564 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:18:37,564 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:37,564 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:37,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:37,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:37,564 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:37,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:37,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:37,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:37,565 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration18_Loop [2022-07-22 12:18:37,565 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:37,565 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:37,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,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:18:37,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,648 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:37,648 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:37,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:37,650 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:18:37,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:18:37,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:37,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:37,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:37,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:37,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:37,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:37,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:37,669 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:18:37,678 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:37,681 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:18:37,681 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:18:37,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:37,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:37,683 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:18:37,684 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:37,685 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:37,685 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:37,685 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:18:37,697 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:18:37,711 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:18:37,711 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:37,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:37,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:37,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:37,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:37,773 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:18:37,774 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:18:37,775 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:18:37,837 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:18:37,838 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:18:37,838 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:18:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-07-22 12:18:37,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 3 letters. [2022-07-22 12:18:37,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:37,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2022-07-22 12:18:37,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:37,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 6 letters. [2022-07-22 12:18:37,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:37,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 4314 transitions. [2022-07-22 12:18:37,857 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-07-22 12:18:37,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 586 states and 1666 transitions. [2022-07-22 12:18:37,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-07-22 12:18:37,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-07-22 12:18:37,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 586 states and 1666 transitions. [2022-07-22 12:18:37,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:18:37,865 INFO L220 hiAutomatonCegarLoop]: Abstraction has 586 states and 1666 transitions. [2022-07-22 12:18:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states and 1666 transitions. [2022-07-22 12:18:37,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 290. [2022-07-22 12:18:37,879 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:18:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 884 transitions. [2022-07-22 12:18:37,880 INFO L242 hiAutomatonCegarLoop]: Abstraction has 290 states and 884 transitions. [2022-07-22 12:18:37,881 INFO L425 stractBuchiCegarLoop]: Abstraction has 290 states and 884 transitions. [2022-07-22 12:18:37,881 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-22 12:18:37,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 884 transitions. [2022-07-22 12:18:37,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:18:37,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:37,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:37,884 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:18:37,884 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:37,885 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:18:37,885 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:18:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:37,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1002913489, now seen corresponding path program 3 times [2022-07-22 12:18:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:37,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572836115] [2022-07-22 12:18:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash 13810, now seen corresponding path program 2 times [2022-07-22 12:18:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:37,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564807603] [2022-07-22 12:18:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1727201474, now seen corresponding path program 4 times [2022-07-22 12:18:37,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:37,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639978584] [2022-07-22 12:18:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,935 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:37,982 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:37,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:37,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:37,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:37,983 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:18:37,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:37,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:37,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:37,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration19_Loop [2022-07-22 12:18:37,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:37,983 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:37,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:37,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:18:38,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:18:38,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,072 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:38,072 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:18:38,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:38,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:38,073 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:18:38,074 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:18:38,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:18:38,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:38,129 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:18:38,149 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:18:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:38,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:38,150 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:18:38,150 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:18:38,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:18:38,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:18:38,297 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:18:38,299 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:18:38,300 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:38,300 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:38,300 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:38,300 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:38,300 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:38,300 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:38,300 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:38,300 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:38,300 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration19_Loop [2022-07-22 12:18:38,300 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:38,300 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:38,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:18:38,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,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:18:38,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:38,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:18:38,397 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:38,397 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:38,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:38,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:38,399 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:18:38,399 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:18:38,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:38,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:38,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:38,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:38,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:38,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:38,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:38,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:38,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:38,411 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:18:38,411 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:18:38,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:38,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:38,413 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:18:38,414 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:18:38,414 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:38,414 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:18:38,414 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:38,415 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:18:38,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2022-07-22 12:18:38,437 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:18:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:38,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:38,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:38,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:38,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:38,488 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:18:38,488 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:18:38,488 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:18:38,521 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:18:38,521 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:18:38,522 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:18:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-07-22 12:18:38,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:18:38,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:38,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:18:38,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:38,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:18:38,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:38,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 638 states and 1932 transitions. [2022-07-22 12:18:38,533 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:18:38,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 638 states to 0 states and 0 transitions. [2022-07-22 12:18:38,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 12:18:38,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 12:18:38,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 12:18:38,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:18:38,534 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:18:38,534 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:18:38,534 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:18:38,534 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-22 12:18:38,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 12:18:38,535 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:18:38,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 12:18:38,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:18:38 BoogieIcfgContainer [2022-07-22 12:18:38,543 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:18:38,544 INFO L158 Benchmark]: Toolchain (without parser) took 25315.51ms. Allocated memory was 154.1MB in the beginning and 223.3MB in the end (delta: 69.2MB). Free memory was 129.1MB in the beginning and 162.7MB in the end (delta: -33.6MB). Peak memory consumption was 37.1MB. Max. memory is 8.0GB. [2022-07-22 12:18:38,545 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 154.1MB. Free memory was 125.1MB in the beginning and 125.1MB in the end (delta: 82.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:18:38,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.42ms. Allocated memory is still 154.1MB. Free memory was 128.9MB in the beginning and 118.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-07-22 12:18:38,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.95ms. Allocated memory is still 154.1MB. Free memory was 118.5MB in the beginning and 116.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:18:38,546 INFO L158 Benchmark]: Boogie Preprocessor took 34.25ms. Allocated memory is still 154.1MB. Free memory was 116.8MB in the beginning and 115.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:18:38,547 INFO L158 Benchmark]: RCFGBuilder took 533.27ms. Allocated memory is still 154.1MB. Free memory was 115.5MB in the beginning and 103.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-07-22 12:18:38,547 INFO L158 Benchmark]: BuchiAutomizer took 24416.75ms. Allocated memory was 154.1MB in the beginning and 223.3MB in the end (delta: 69.2MB). Free memory was 103.0MB in the beginning and 162.7MB in the end (delta: -59.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-07-22 12:18:38,550 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.28ms. Allocated memory is still 154.1MB. Free memory was 125.1MB in the beginning and 125.1MB in the end (delta: 82.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.42ms. Allocated memory is still 154.1MB. Free memory was 128.9MB in the beginning and 118.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.95ms. Allocated memory is still 154.1MB. Free memory was 118.5MB in the beginning and 116.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.25ms. Allocated memory is still 154.1MB. Free memory was 116.8MB in the beginning and 115.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 533.27ms. Allocated memory is still 154.1MB. Free memory was 115.5MB in the beginning and 103.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 24416.75ms. Allocated memory was 154.1MB in the beginning and 223.3MB in the end (delta: 69.2MB). Free memory was 103.0MB in the beginning and 162.7MB in the end (delta: -59.7MB). Peak memory consumption was 10.9MB. 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.1s and 20 iterations. TraceHistogramMax:2. Analysis of lassos took 16.1s. Construction of modules took 0.9s. Büchi inclusion checks took 2.4s. 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, 0.9s 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: 57ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 40 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 19 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.9s 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: UnionIndependenceRelation.Independence Queries: [ total: 531, positive: 531, positive conditional: 0, positive unconditional: 531, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 531, positive: 531, positive conditional: 0, positive unconditional: 531, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 721, positive: 190, positive conditional: 0, positive unconditional: 190, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 531, unknown conditional: 0, unknown unconditional: 531] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, 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:18:38,604 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:18:38,818 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...