/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:43:38,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:43:38,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:43:38,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:43:38,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:43:38,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:43:38,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:43:38,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:43:38,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:43:38,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:43:38,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:43:38,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:43:38,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:43:38,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:43:38,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:43:38,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:43:38,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:43:38,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:43:38,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:43:38,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:43:38,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:43:38,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:43:38,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:43:38,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:43:38,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:43:38,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:43:38,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:43:38,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:43:38,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:43:38,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:43:38,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:43:38,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:43:38,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:43:38,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:43:38,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:43:38,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:43:38,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:43:38,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:43:38,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:43:38,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:43:38,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:43:38,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:43:38,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:43:38,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:43:38,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:43:38,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:43:38,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:43:38,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:43:38,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:43:38,245 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:43:38,245 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:43:38,245 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:43:38,246 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:43:38,246 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:43:38,246 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:43:38,246 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:43:38,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:43:38,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:43:38,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:43:38,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:43:38,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:43:38,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:43:38,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:43:38,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:43:38,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:43:38,249 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:43:38,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:43:38,249 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:43:38,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:43:38,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:43:38,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:43:38,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:43:38,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:43:38,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:43:38,251 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:43:38,253 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:43:38,253 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:43:38,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:43:38,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:43:38,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:43:38,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:43:38,646 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:43:38,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-07-22 12:43:38,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58e134a3/3e4477f3aae1443282ac50671200ff45/FLAG59da988a9 [2022-07-22 12:43:39,346 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:43:39,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-07-22 12:43:39,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58e134a3/3e4477f3aae1443282ac50671200ff45/FLAG59da988a9 [2022-07-22 12:43:39,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58e134a3/3e4477f3aae1443282ac50671200ff45 [2022-07-22 12:43:39,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:43:39,733 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:43:39,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:43:39,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:43:39,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:43:39,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12850519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:39, skipping insertion in model container [2022-07-22 12:43:39,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:43:39" (1/1) ... [2022-07-22 12:43:39,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:43:39,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:43:40,073 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/fibonacci.wvr.c[2330,2343] [2022-07-22 12:43:40,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:43:40,101 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:43:40,125 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/fibonacci.wvr.c[2330,2343] [2022-07-22 12:43:40,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:43:40,146 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:43:40,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40 WrapperNode [2022-07-22 12:43:40,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:43:40,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:43:40,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:43:40,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:43:40,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,208 INFO L137 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 159 [2022-07-22 12:43:40,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:43:40,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:43:40,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:43:40,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:43:40,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:43:40,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:43:40,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:43:40,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:43:40,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (1/1) ... [2022-07-22 12:43:40,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:40,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:40,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:40,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:43:40,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:43:40,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:43:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:43:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:43:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:43:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:43:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:43:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:43:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:43:40,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:43:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:43:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:43:40,370 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:43:40,467 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:43:40,468 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:43:41,046 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:43:41,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:43:41,071 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 12:43:41,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:43:41 BoogieIcfgContainer [2022-07-22 12:43:41,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:43:41,081 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:43:41,081 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:43:41,086 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:43:41,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:43:41,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:43:39" (1/3) ... [2022-07-22 12:43:41,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58efd60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:43:41, skipping insertion in model container [2022-07-22 12:43:41,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:43:41,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:43:40" (2/3) ... [2022-07-22 12:43:41,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58efd60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:43:41, skipping insertion in model container [2022-07-22 12:43:41,091 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:43:41,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:43:41" (3/3) ... [2022-07-22 12:43:41,092 INFO L322 chiAutomizerObserver]: Analyzing ICFG fibonacci.wvr.c [2022-07-22 12:43:41,306 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:43:41,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 209 places, 220 transitions, 456 flow [2022-07-22 12:43:41,459 INFO L129 PetriNetUnfolder]: 16/216 cut-off events. [2022-07-22 12:43:41,459 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:43:41,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 216 events. 16/216 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 374 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 149. Up to 2 conditions per place. [2022-07-22 12:43:41,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 220 transitions, 456 flow [2022-07-22 12:43:41,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 216 transitions, 444 flow [2022-07-22 12:43:41,502 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:43:41,515 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 216 transitions, 444 flow [2022-07-22 12:43:41,520 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 216 transitions, 444 flow [2022-07-22 12:43:41,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 207 places, 216 transitions, 444 flow [2022-07-22 12:43:41,573 INFO L129 PetriNetUnfolder]: 16/216 cut-off events. [2022-07-22 12:43:41,573 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:43:41,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 216 events. 16/216 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 149. Up to 2 conditions per place. [2022-07-22 12:43:41,586 INFO L116 LiptonReduction]: Number of co-enabled transitions 11592 [2022-07-22 12:43:47,599 INFO L131 LiptonReduction]: Checked pairs total: 9487 [2022-07-22 12:43:47,600 INFO L133 LiptonReduction]: Total number of compositions: 251 [2022-07-22 12:43:47,621 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:43:47,621 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:43:47,622 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:43:47,622 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:43:47,622 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:43:47,622 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:43:47,622 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:43:47,622 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:43:47,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:43:47,661 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:43:47,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:47,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:47,667 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:43:47,668 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:47,668 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:43:47,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33 states, but on-demand construction may add more states [2022-07-22 12:43:47,672 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:43:47,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:47,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:47,673 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:43:47,673 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:47,679 INFO L748 eck$LassoCheckResult]: Stem: 212#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 215#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 217#[thread1ENTRY, L78-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 221#[L44-5, L78-4]don't care [2022-07-22 12:43:47,680 INFO L750 eck$LassoCheckResult]: Loop: 221#[L44-5, L78-4]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 221#[L44-5, L78-4]don't care [2022-07-22 12:43:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash 912369, now seen corresponding path program 1 times [2022-07-22 12:43:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:47,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680706090] [2022-07-22 12:43:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:47,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:47,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash 929, now seen corresponding path program 1 times [2022-07-22 12:43:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:47,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469086345] [2022-07-22 12:43:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:47,917 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:47,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash 28284337, now seen corresponding path program 1 times [2022-07-22 12:43:47,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:47,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115393062] [2022-07-22 12:43:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:48,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:48,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:48,400 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:48,401 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:48,401 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:48,401 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:48,402 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:48,402 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:48,402 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:48,402 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:48,402 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:43:48,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:48,403 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:48,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,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:43:48,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:48,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:43:48,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:43:49,241 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:49,242 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:43:49,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:49,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,288 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:49,288 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:49,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:43:49,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:49,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,348 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:49,349 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~ret3#1=0} Honda state: {thread1Thread1of1ForFork1_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:49,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:49,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:43:49,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:49,440 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1#1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:49,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:43:49,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:49,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:49,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:49,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:43:49,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:49,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:49,707 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:49,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:49,711 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:49,711 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:49,711 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:49,711 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:49,712 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:49,712 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:49,712 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:49,712 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:49,713 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:43:49,713 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:49,713 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:49,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,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:43:49,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:43:49,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:43:49,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:49,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:50,542 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:50,580 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:50,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:43:50,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:50,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:50,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:50,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:50,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:50,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:50,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:50,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:50,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,678 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:50,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:50,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:50,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:50,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:50,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:50,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:50,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:50,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:43:50,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:50,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:50,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,755 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:50,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:43:50,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:50,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:50,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:50,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:50,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:50,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:50,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:50,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:50,819 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:43:50,819 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:43:50,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:50,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:50,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:50,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:43:50,837 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:50,837 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:50,837 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:50,838 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread1Thread1of1ForFork1_~i~0#1) = 1*~n_0~0 - 1*thread1Thread1of1ForFork1_~i~0#1 Supporting invariants [] [2022-07-22 12:43:50,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:50,881 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:50,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:50,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:50,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:50,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:50,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:43:50,996 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:43:50,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 33 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:51,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 33 states, but on-demand construction may add more states. 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 63 states and 161 transitions. Complement of second has 3 states. [2022-07-22 12:43:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:43:51,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:43:51,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:43:51,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:43:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:51,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 161 transitions. [2022-07-22 12:43:51,096 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:43:51,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 52 states and 135 transitions. [2022-07-22 12:43:51,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:43:51,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-22 12:43:51,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 135 transitions. [2022-07-22 12:43:51,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:43:51,107 INFO L220 hiAutomatonCegarLoop]: Abstraction has 52 states and 135 transitions. [2022-07-22 12:43:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 135 transitions. [2022-07-22 12:43:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-07-22 12:43:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 104 transitions. [2022-07-22 12:43:51,143 INFO L242 hiAutomatonCegarLoop]: Abstraction has 40 states and 104 transitions. [2022-07-22 12:43:51,143 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 104 transitions. [2022-07-22 12:43:51,144 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:43:51,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 104 transitions. [2022-07-22 12:43:51,146 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:43:51,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:51,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:51,147 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:43:51,147 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:51,148 INFO L748 eck$LassoCheckResult]: Stem: 422#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 382#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 384#[thread1ENTRY, L78-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 438#[L44-5, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 390#[L44-5, L79-3]don't care [2022-07-22 12:43:51,148 INFO L750 eck$LassoCheckResult]: Loop: 390#[L44-5, L79-3]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 390#[L44-5, L79-3]don't care [2022-07-22 12:43:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash 28284256, now seen corresponding path program 1 times [2022-07-22 12:43:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:51,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119366994] [2022-07-22 12:43:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:51,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:51,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:51,236 INFO L85 PathProgramCache]: Analyzing trace with hash 929, now seen corresponding path program 2 times [2022-07-22 12:43:51,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:51,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690738539] [2022-07-22 12:43:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:51,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:51,307 INFO L85 PathProgramCache]: Analyzing trace with hash 876812834, now seen corresponding path program 1 times [2022-07-22 12:43:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:51,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498852409] [2022-07-22 12:43:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:51,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:51,637 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:51,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:51,640 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:51,640 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:51,640 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:51,641 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:51,641 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:51,641 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:51,641 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:43:51,641 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:51,641 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:51,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:43:51,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:43:51,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:51,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:52,374 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:52,374 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:52,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,376 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:43:52,397 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:52,398 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~ret3#1=0} Honda state: {thread1Thread1of1ForFork1_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:52,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,426 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:43:52,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,442 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:52,442 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Honda state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:52,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:43:52,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,480 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:52,480 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_3=0} Honda state: {v_rep#funAddr~thread1.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:52,521 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:43:52,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,523 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:43:52,549 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:52,549 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1#1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:52,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,587 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:43:52,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,599 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:52,601 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~ret2#1=0} Honda state: {thread1Thread1of1ForFork1_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:52,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,625 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:43:52,652 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:52,653 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_3=-1} Honda state: {v_rep#funAddr~thread1.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:52,676 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:43:52,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,677 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:52,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:43:52,696 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:52,696 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_3=-1} Honda state: {v_rep#funAddr~thread2.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:52,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:52,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:52,724 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:52,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:43:52,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:52,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:53,009 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:53,010 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_minus_#in~a#1=0, ~f2_3~0=0, thread1Thread1of1ForFork1_minus_#res#1=0, thread1Thread1of1ForFork1_plus_~b#1=0, thread1Thread1of1ForFork1_plus_#in~a#1=0, thread1Thread1of1ForFork1_minus_#in~b#1=0, ~f1_2~0=0, thread1Thread1of1ForFork1_minus_~b#1=0, thread1Thread1of1ForFork1_plus_~a#1=0, thread1Thread1of1ForFork1_minus_~a#1=0, thread1Thread1of1ForFork1_plus_#in~b#1=0, thread1Thread1of1ForFork1_plus_#res#1=0} Honda state: {thread1Thread1of1ForFork1_minus_#in~a#1=0, ~f2_3~0=0, thread1Thread1of1ForFork1_minus_#res#1=0, thread1Thread1of1ForFork1_plus_~b#1=0, thread1Thread1of1ForFork1_plus_#in~a#1=0, thread1Thread1of1ForFork1_minus_#in~b#1=0, ~f1_2~0=0, thread1Thread1of1ForFork1_minus_~b#1=0, thread1Thread1of1ForFork1_plus_~a#1=0, thread1Thread1of1ForFork1_minus_~a#1=0, thread1Thread1of1ForFork1_plus_#in~b#1=0, thread1Thread1of1ForFork1_plus_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:53,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-22 12:43:53,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:53,033 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:53,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:43:53,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:53,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:53,048 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:53,049 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_3=1} Honda state: {v_rep#funAddr~thread2.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:53,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:53,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:53,073 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:53,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:43:53,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:53,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:53,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:53,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:53,114 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:53,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:43:53,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:53,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:53,260 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:53,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:53,264 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:53,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:53,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:53,265 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:53,265 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:53,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:53,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:53,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:53,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:43:53,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:53,265 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:53,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,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:43:53,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:43:53,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,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:43:53,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:53,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,042 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:54,043 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:54,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,048 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:43:54,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:54,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,119 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:43:54,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:54,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 12:43:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,156 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:43:54,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:54,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:54,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,196 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:43:54,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,198 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:43:54,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:54,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,235 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:43:54,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:54,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,269 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:43:54,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:54,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:54,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,313 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:43:54,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:54,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:54,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,382 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:43:54,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,391 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-22 12:43:54,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:54,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:54,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,468 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:54,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:54,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:43:54,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:54,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 12:43:54,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,528 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:43:54,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:54,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:54,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:54,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:54,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:54,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:54,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:54,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:54,541 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:54,543 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:43:54,544 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:43:54,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:54,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:54,545 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:54,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:43:54,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:54,546 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:54,546 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:54,546 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread1Thread1of1ForFork1_~i~0#1) = 1*~n_0~0 - 1*thread1Thread1of1ForFork1_~i~0#1 Supporting invariants [] [2022-07-22 12:43:54,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:43:54,573 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:54,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:54,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:54,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:54,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:43:54,644 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:43:54,645 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 104 transitions. cyclomatic complexity: 84 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:54,686 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 104 transitions. cyclomatic complexity: 84. 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 45 states and 115 transitions. Complement of second has 3 states. [2022-07-22 12:43:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2022-07-22 12:43:54,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:43:54,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:54,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:43:54,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:54,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:43:54,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:54,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 115 transitions. [2022-07-22 12:43:54,697 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:43:54,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 115 transitions. [2022-07-22 12:43:54,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:43:54,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-07-22 12:43:54,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 115 transitions. [2022-07-22 12:43:54,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:43:54,707 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 115 transitions. [2022-07-22 12:43:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 115 transitions. [2022-07-22 12:43:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-22 12:43:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 101 transitions. [2022-07-22 12:43:54,720 INFO L242 hiAutomatonCegarLoop]: Abstraction has 39 states and 101 transitions. [2022-07-22 12:43:54,721 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 101 transitions. [2022-07-22 12:43:54,721 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:43:54,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 101 transitions. [2022-07-22 12:43:54,726 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:43:54,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:54,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:54,727 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:43:54,727 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:54,728 INFO L748 eck$LassoCheckResult]: Stem: 578#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 538#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 540#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 598#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 588#[thread1ENTRY, thread2ENTRY, L79-4]don't care [573] thread2ENTRY-->L54-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 558#[thread1ENTRY, L54-5, L79-4]don't care [2022-07-22 12:43:54,728 INFO L750 eck$LassoCheckResult]: Loop: 558#[thread1ENTRY, L54-5, L79-4]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 558#[thread1ENTRY, L54-5, L79-4]don't care [2022-07-22 12:43:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash 877107939, now seen corresponding path program 1 times [2022-07-22 12:43:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:54,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521245173] [2022-07-22 12:43:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash 931, now seen corresponding path program 1 times [2022-07-22 12:43:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:54,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528386822] [2022-07-22 12:43:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1420543233, now seen corresponding path program 1 times [2022-07-22 12:43:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:54,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615563660] [2022-07-22 12:43:54,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:54,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:55,167 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:55,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:55,168 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:55,168 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:55,168 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:55,168 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,168 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:55,168 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:55,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:43:55,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:55,168 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:55,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,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:43:55,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,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:43:55,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:55,614 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:43:55,798 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:55,799 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:55,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,804 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:43:55,815 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:55,815 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~ret7#1=0} Honda state: {thread2Thread1of1ForFork0_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:55,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-22 12:43:55,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,837 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:43:55,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:55,856 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:55,856 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_5=0} Honda state: {v_rep#funAddr~thread1.offset_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:55,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 12:43:55,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:55,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:55,883 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:55,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:43:55,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:55,886 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,302 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,302 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_plus_#in~a#1=0, thread2Thread1of1ForFork0_minus_~b#1=0, thread2Thread1of1ForFork0_plus_~a#1=0, thread2Thread1of1ForFork0_minus_#res#1=0, ~f1_6~0=0, thread2Thread1of1ForFork0_minus_~a#1=0, thread2Thread1of1ForFork0_plus_#in~b#1=0, thread2Thread1of1ForFork0_minus_#in~a#1=0, thread2Thread1of1ForFork0_plus_#res#1=0, thread2Thread1of1ForFork0_plus_~b#1=0, ~f2_7~0=0, thread2Thread1of1ForFork0_minus_#in~b#1=0} Honda state: {thread2Thread1of1ForFork0_plus_#in~a#1=0, thread2Thread1of1ForFork0_minus_~b#1=0, thread2Thread1of1ForFork0_plus_~a#1=0, thread2Thread1of1ForFork0_minus_#res#1=0, ~f1_6~0=0, thread2Thread1of1ForFork0_minus_~a#1=0, thread2Thread1of1ForFork0_plus_#in~b#1=0, thread2Thread1of1ForFork0_minus_#in~a#1=0, thread2Thread1of1ForFork0_plus_#res#1=0, thread2Thread1of1ForFork0_plus_~b#1=0, ~f2_7~0=0, thread2Thread1of1ForFork0_minus_#in~b#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:56,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,325 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:43:56,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,343 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_5=-1} Honda state: {v_rep#funAddr~thread1.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:56,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-22 12:43:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,367 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:43:56,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,389 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_5=-1} Honda state: {v_rep#funAddr~thread2.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:56,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 12:43:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,411 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:43:56,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,428 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:56,428 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=1} Honda state: {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:56,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,452 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:56,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:43:56,484 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:43:56,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:56,486 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:56,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:43:56,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:56,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:56,715 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:56,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:56,719 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:56,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:56,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:56,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:56,719 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:56,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:56,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:56,719 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:56,719 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:43:56,719 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:56,719 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:56,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,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:43:56,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,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:43:56,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:56,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:43:57,329 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:57,330 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:43:57,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,331 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:57,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:57,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:57,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,344 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 12:43:57,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,352 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 12:43:57,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:57,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:43:57,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 12:43:57,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,391 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:57,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:57,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:43:57,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:57,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:57,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:57,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:57,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,454 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:57,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:43:57,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:57,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:57,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:57,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,489 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:43:57,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,491 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:57,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:43:57,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:43:57,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:57,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:57,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:57,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,529 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:57,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:43:57,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:43:57,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:43:57,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:43:57,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:57,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,602 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:57,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:57,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:57,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:57,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:57,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:43:57,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:43:57,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 12:43:57,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,651 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:57,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 12:43:57,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:43:57,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:43:57,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:43:57,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:43:57,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:43:57,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:43:57,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:43:57,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:43:57,662 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:43:57,664 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:43:57,665 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:43:57,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:57,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:57,666 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:57,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 12:43:57,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:43:57,668 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:43:57,668 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:43:57,668 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread2Thread1of1ForFork0_~i~1#1) = 1*~n_0~0 - 1*thread2Thread1of1ForFork0_~i~1#1 Supporting invariants [] [2022-07-22 12:43:57,690 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:43:57,691 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:43:57,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:57,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:43:57,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:43:57,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:43:57,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:43:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:43:57,759 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:43:57,759 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 101 transitions. cyclomatic complexity: 81 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,808 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 101 transitions. cyclomatic complexity: 81. 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 64 states and 166 transitions. Complement of second has 3 states. [2022-07-22 12:43:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:43:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:43:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:43:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:43:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:43:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:43:57,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 166 transitions. [2022-07-22 12:43:57,819 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:43:57,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 61 states and 162 transitions. [2022-07-22 12:43:57,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-22 12:43:57,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-22 12:43:57,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 162 transitions. [2022-07-22 12:43:57,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:43:57,824 INFO L220 hiAutomatonCegarLoop]: Abstraction has 61 states and 162 transitions. [2022-07-22 12:43:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 162 transitions. [2022-07-22 12:43:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-07-22 12:43:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.64) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:43:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 132 transitions. [2022-07-22 12:43:57,830 INFO L242 hiAutomatonCegarLoop]: Abstraction has 50 states and 132 transitions. [2022-07-22 12:43:57,830 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 132 transitions. [2022-07-22 12:43:57,830 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:43:57,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 132 transitions. [2022-07-22 12:43:57,831 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:43:57,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:43:57,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:43:57,832 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:43:57,832 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:43:57,833 INFO L748 eck$LassoCheckResult]: Stem: 764#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 716#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 718#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 792#[thread1ENTRY, L79-3]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 724#[L44-5, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 726#[thread2ENTRY, L79-4, L44-5]don't care [2022-07-22 12:43:57,833 INFO L750 eck$LassoCheckResult]: Loop: 726#[thread2ENTRY, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 726#[thread2ENTRY, L79-4, L44-5]don't care [2022-07-22 12:43:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,833 INFO L85 PathProgramCache]: Analyzing trace with hash 877103670, now seen corresponding path program 1 times [2022-07-22 12:43:57,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:57,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37899037] [2022-07-22 12:43:57,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:57,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,849 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash 929, now seen corresponding path program 3 times [2022-07-22 12:43:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:57,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948693331] [2022-07-22 12:43:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:43:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1420410892, now seen corresponding path program 1 times [2022-07-22 12:43:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:43:57,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127676263] [2022-07-22 12:43:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:43:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:43:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,909 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:43:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:43:57,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:43:58,201 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:58,202 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:58,202 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:58,202 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:58,202 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:43:58,202 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:58,202 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:58,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:58,202 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:43:58,202 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:58,203 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:58,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,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:43:58,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:58,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:59,023 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:43:59,023 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:43:59,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,024 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 12:43:59,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:59,034 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1#1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:59,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 12:43:59,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,057 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 12:43:59,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,065 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:59,066 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~ret3#1=0} Honda state: {thread1Thread1of1ForFork1_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:59,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 12:43:59,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,089 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 12:43:59,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,354 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:59,354 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_minus_#in~a#1=0, ~f2_3~0=0, thread1Thread1of1ForFork1_minus_#res#1=0, thread1Thread1of1ForFork1_plus_~b#1=0, thread1Thread1of1ForFork1_plus_#in~a#1=0, thread1Thread1of1ForFork1_minus_#in~b#1=0, ~f1_2~0=0, thread1Thread1of1ForFork1_minus_~b#1=0, thread1Thread1of1ForFork1_minus_~a#1=0, thread1Thread1of1ForFork1_plus_~a#1=0, thread1Thread1of1ForFork1_plus_#in~b#1=0, thread1Thread1of1ForFork1_plus_#res#1=0} Honda state: {thread1Thread1of1ForFork1_minus_#in~a#1=0, ~f2_3~0=0, thread1Thread1of1ForFork1_minus_#res#1=0, thread1Thread1of1ForFork1_plus_~b#1=0, thread1Thread1of1ForFork1_plus_#in~a#1=0, thread1Thread1of1ForFork1_minus_#in~b#1=0, ~f1_2~0=0, thread1Thread1of1ForFork1_minus_~b#1=0, thread1Thread1of1ForFork1_minus_~a#1=0, thread1Thread1of1ForFork1_plus_~a#1=0, thread1Thread1of1ForFork1_plus_#in~b#1=0, thread1Thread1of1ForFork1_plus_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:59,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:59,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,379 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 12:43:59,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,395 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:59,395 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_7=-1} Honda state: {v_rep#funAddr~thread2.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:59,416 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:43:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,417 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 12:43:59,433 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:59,434 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_7=-1} Honda state: {v_rep#funAddr~thread1.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:59,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:59,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,458 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 12:43:59,474 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:59,474 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Honda state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:59,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-22 12:43:59,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,497 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 12:43:59,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,508 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:59,508 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~ret2#1=0} Honda state: {thread1Thread1of1ForFork1_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:59,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:59,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,531 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 12:43:59,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,545 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:43:59,545 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_7=0} Honda state: {v_rep#funAddr~thread1.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:43:59,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-22 12:43:59,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,568 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:43:59,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 12:43:59,599 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:43:59,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:43:59,601 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:43:59,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 12:43:59,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:43:59,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:43:59,745 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:43:59,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 12:43:59,748 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:43:59,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:43:59,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:43:59,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:43:59,748 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:43:59,748 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:43:59,748 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:43:59,748 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:43:59,748 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:43:59,748 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:43:59,748 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:43:59,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,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:43:59,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:43:59,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:00,470 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:00,470 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:00,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,472 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:44:00,472 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:44:00,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:00,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:00,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,507 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:44:00,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,508 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:44:00,509 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:44:00,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:00,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,541 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:44:00,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,542 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:44:00,543 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:44:00,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,550 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-22 12:44:00,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:00,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-22 12:44:00,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,608 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:44:00,608 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:44:00,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:00,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:00,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:00,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,644 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:44:00,645 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:44:00,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:00,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,676 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:44:00,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,677 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:44:00,678 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:44:00,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:00,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:00,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-22 12:44:00,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,712 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:44:00,713 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:44:00,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:00,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:00,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-22 12:44:00,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,748 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:44:00,748 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:44:00,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:00,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,779 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:44:00,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,780 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:44:00,782 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:44:00,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:00,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:00,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 12:44:00,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,816 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:44:00,816 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:44:00,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:00,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:00,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:00,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:00,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:00,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:00,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:00,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:00,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:00,843 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:44:00,843 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:44:00,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:00,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:00,845 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:44:00,867 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:44:00,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:00,868 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:00,868 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:00,868 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread1Thread1of1ForFork1_~i~0#1) = 1*~n_0~0 - 1*thread1Thread1of1ForFork1_~i~0#1 Supporting invariants [] [2022-07-22 12:44:00,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 12:44:00,891 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:00,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:00,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:00,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:00,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:00,936 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:00,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 132 transitions. cyclomatic complexity: 107 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:44:00,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 132 transitions. cyclomatic complexity: 107. 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 57 states and 152 transitions. Complement of second has 3 states. [2022-07-22 12:44:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:00,971 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:44:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2022-07-22 12:44:00,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:44:00,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:00,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:44:00,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:00,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:44:00,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:00,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 152 transitions. [2022-07-22 12:44:00,973 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:44:00,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 152 transitions. [2022-07-22 12:44:00,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-22 12:44:00,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-22 12:44:00,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 152 transitions. [2022-07-22 12:44:00,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:00,980 INFO L220 hiAutomatonCegarLoop]: Abstraction has 57 states and 152 transitions. [2022-07-22 12:44:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 152 transitions. [2022-07-22 12:44:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-07-22 12:44:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.6) internal successors, (130), 49 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 130 transitions. [2022-07-22 12:44:00,986 INFO L242 hiAutomatonCegarLoop]: Abstraction has 50 states and 130 transitions. [2022-07-22 12:44:00,986 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 130 transitions. [2022-07-22 12:44:00,986 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:44:00,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 130 transitions. [2022-07-22 12:44:00,987 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:44:00,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:00,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:00,988 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:44:00,988 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:44:00,988 INFO L748 eck$LassoCheckResult]: Stem: 955#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 907#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 909#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 983#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 969#[thread1ENTRY, thread2ENTRY, L79-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 971#[thread2ENTRY, L79-4, L44-5]don't care [760] L79-4-->L80-1: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_13|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_13|) (select |v_#length_25| |v_ULTIMATE.start_main_~#t1~0#1.base_15|)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) 1) (= |v_ULTIMATE.start_main_#t~mem20#1_10| (select (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_13|))) InVars {#valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, 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~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_7|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet19#1] 935#[thread2ENTRY, L44-5, L80-1]don't care [2022-07-22 12:44:00,989 INFO L750 eck$LassoCheckResult]: Loop: 935#[thread2ENTRY, L44-5, L80-1]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 935#[thread2ENTRY, L44-5, L80-1]don't care [2022-07-22 12:44:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1420540954, now seen corresponding path program 1 times [2022-07-22 12:44:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:00,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039837103] [2022-07-22 12:44:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,003 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash 929, now seen corresponding path program 4 times [2022-07-22 12:44:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:01,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845039676] [2022-07-22 12:44:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:01,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1087097512, now seen corresponding path program 1 times [2022-07-22 12:44:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:01,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487645520] [2022-07-22 12:44:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,054 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:01,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:01,314 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:01,314 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:01,314 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:01,314 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:01,314 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:01,314 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:01,314 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:01,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:01,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:44:01,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:01,315 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:01,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:01,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:44:01,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:01,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:44:01,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:01,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:01,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:44:01,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:44:01,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:01,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,084 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:02,084 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:02,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,085 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:44:02,086 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:44:02,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,100 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:44:02,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:02,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,123 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:44:02,124 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:44:02,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,132 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~ret3#1=0} Honda state: {thread1Thread1of1ForFork1_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:02,154 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:44:02,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,155 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:44:02,156 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:44:02,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,167 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,168 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1#1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:02,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-22 12:44:02,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,192 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:44:02,192 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:44:02,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,206 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,206 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_9=-1} Honda state: {v_rep#funAddr~thread1.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:02,228 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:44:02,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,229 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:44:02,230 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:44:02,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,246 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:44:02,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-22 12:44:02,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,270 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:44:02,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,279 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:44:02,287 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,287 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_9=1} Honda state: {v_rep#funAddr~thread2.offset_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:02,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:02,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,310 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:44:02,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,326 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:44:02,327 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:02,327 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Honda state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:02,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-22 12:44:02,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,350 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:44:02,350 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:44:02,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:02,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,406 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:44:02,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:02,407 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:44:02,408 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:44:02,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:02,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:02,553 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:02,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-07-22 12:44:02,555 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:02,555 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:02,555 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:02,555 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:02,556 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:02,556 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:02,556 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:02,556 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:02,556 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:44:02,556 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:02,556 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:02,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,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:44:02,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:44:02,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:44:02,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:02,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:03,012 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:44:03,332 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:03,333 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:03,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,336 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:44:03,337 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:44:03,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:03,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:03,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:03,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:03,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,376 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:44:03,377 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:44:03,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:44:03,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:03,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:03,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:03,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,422 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:44:03,423 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:44:03,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:03,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:03,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:03,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:03,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-22 12:44:03,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,461 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:44:03,462 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:44:03,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:03,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:03,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:03,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:03,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:03,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-22 12:44:03,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,496 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:44:03,497 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:44:03,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:03,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:03,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:03,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:03,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:03,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,562 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:44:03,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:03,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:03,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:03,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:03,577 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:44:03,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:03,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,626 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:44:03,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:03,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:03,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:03,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:03,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:03,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:03,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:03,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:03,642 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:44:03,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:03,657 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:44:03,658 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:44:03,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:03,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:03,659 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:44:03,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:03,664 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:03,665 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:03,665 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread1Thread1of1ForFork1_~i~0#1) = 1*~n_0~0 - 1*thread1Thread1of1ForFork1_~i~0#1 Supporting invariants [] [2022-07-22 12:44:03,677 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:44:03,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:03,694 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:03,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:03,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:03,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:03,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:03,743 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:03,743 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 130 transitions. cyclomatic complexity: 105 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:44:03,788 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 130 transitions. cyclomatic complexity: 105. 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 68 states and 173 transitions. Complement of second has 3 states. [2022-07-22 12:44:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:03,790 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:44:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:44:03,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:44:03,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:03,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:44:03,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:03,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:44:03,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:03,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 173 transitions. [2022-07-22 12:44:03,793 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:44:03,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 63 states and 164 transitions. [2022-07-22 12:44:03,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-22 12:44:03,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-07-22 12:44:03,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 164 transitions. [2022-07-22 12:44:03,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:03,795 INFO L220 hiAutomatonCegarLoop]: Abstraction has 63 states and 164 transitions. [2022-07-22 12:44:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 164 transitions. [2022-07-22 12:44:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-07-22 12:44:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.6041666666666665) internal successors, (125), 47 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 125 transitions. [2022-07-22 12:44:03,801 INFO L242 hiAutomatonCegarLoop]: Abstraction has 48 states and 125 transitions. [2022-07-22 12:44:03,801 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 125 transitions. [2022-07-22 12:44:03,801 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:44:03,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 125 transitions. [2022-07-22 12:44:03,802 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:44:03,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:03,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:03,803 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:03,803 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:44:03,804 INFO L748 eck$LassoCheckResult]: Stem: 1158#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1112#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1114#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 1182#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 1172#[thread1ENTRY, thread2ENTRY, L79-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 1174#[thread2ENTRY, L79-4, L44-5]don't care [573] thread2ENTRY-->L54-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 1190#[L54-5, L79-4, L44-5]don't care [848] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (let ((.cse0 (< 0 v_~f1_2~0_49))) (or (and (= v_~l_4~0_23 0) (not .cse0)) (and (= v_~l_4~0_23 1) .cse0))) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_37| v_~n_0~0_37))) InVars {~f1_2~0=v_~f1_2~0_49, ~n_0~0=v_~n_0~0_37, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_37|} OutVars{~f1_2~0=v_~f1_2~0_49, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_25|, ~n_0~0=v_~n_0~0_37, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_37|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|, ~l_4~0=v_~l_4~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~l_4~0] 1144#[L54-5, thread1EXIT, L79-4]don't care [2022-07-22 12:44:03,804 INFO L750 eck$LassoCheckResult]: Loop: 1144#[L54-5, thread1EXIT, L79-4]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 1144#[L54-5, thread1EXIT, L79-4]don't care [2022-07-22 12:44:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1087091665, now seen corresponding path program 1 times [2022-07-22 12:44:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:03,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071052835] [2022-07-22 12:44:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash 931, now seen corresponding path program 2 times [2022-07-22 12:44:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:03,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591085516] [2022-07-22 12:44:03,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:03,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash -659895853, now seen corresponding path program 1 times [2022-07-22 12:44:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:03,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310116279] [2022-07-22 12:44:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:44:03,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310116279] [2022-07-22 12:44:03,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310116279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:44:03,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:44:03,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:44:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932106275] [2022-07-22 12:44:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:44:04,160 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:04,160 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:04,160 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:04,160 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:04,160 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:04,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:04,161 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:04,161 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:04,161 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:44:04,161 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:04,161 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:04,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:04,899 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:04,899 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:04,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:04,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:04,900 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:44:04,901 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:44:04,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:04,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:04,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:04,915 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_11=0} Honda state: {v_rep#funAddr~thread1.offset_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:04,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-07-22 12:44:04,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:04,937 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:44:04,938 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:44:04,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:04,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:04,953 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:04,953 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_11=-1} Honda state: {v_rep#funAddr~thread2.base_11=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:04,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-07-22 12:44:04,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:04,977 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:44:04,998 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:44:05,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:05,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:05,028 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:05,028 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_11=-1} Honda state: {v_rep#funAddr~thread1.base_11=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:05,031 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:44:05,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:05,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:05,052 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:44:05,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:05,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:05,063 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:44:05,072 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:05,072 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=1} Honda state: {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:05,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-22 12:44:05,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:05,094 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:44:05,095 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:44:05,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:05,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:05,103 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:05,103 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~ret7#1=0} Honda state: {thread2Thread1of1ForFork0_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:05,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-22 12:44:05,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:05,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:05,125 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:44:05,126 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:44:05,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:05,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:05,156 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:44:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:05,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:05,157 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:44:05,158 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:44:05,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:05,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:05,311 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:05,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-22 12:44:05,314 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:05,314 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:05,314 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:05,314 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:05,314 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:05,315 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:05,315 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:05,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:05,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:44:05,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:05,315 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:05,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:44:05,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:05,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:05,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:44:05,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:05,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:05,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:05,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:44:05,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:05,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:06,052 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:06,052 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:06,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:06,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:06,053 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:44:06,054 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:44:06,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:06,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:06,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:06,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:06,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:06,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:06,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:06,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:06,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-22 12:44:06,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:06,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:06,090 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:44:06,090 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:44:06,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:06,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:06,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:06,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:06,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:06,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:06,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:06,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:06,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-07-22 12:44:06,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:06,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:06,125 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:44:06,126 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:44:06,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:06,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:06,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:06,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:06,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:06,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:06,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:06,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:06,185 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:44:06,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:06,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:06,186 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:44:06,186 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:44:06,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:06,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:06,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:06,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:06,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:06,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:06,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:06,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:06,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:06,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:06,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:06,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:06,218 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:44:06,219 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:44:06,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:06,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:06,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:06,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:06,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:06,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:06,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:06,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:06,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:06,232 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:44:06,232 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:44:06,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:06,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:06,233 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:44:06,234 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:44:06,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:06,235 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:06,235 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:06,235 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread2Thread1of1ForFork0_~i~1#1) = 1*~n_0~0 - 1*thread2Thread1of1ForFork0_~i~1#1 Supporting invariants [] [2022-07-22 12:44:06,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:06,258 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:06,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:06,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:06,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:06,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:06,324 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:06,324 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 125 transitions. cyclomatic complexity: 101 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:06,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 125 transitions. cyclomatic complexity: 101. 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 57 states and 141 transitions. Complement of second has 3 states. [2022-07-22 12:44:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:44:06,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:44:06,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:06,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:06,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:06,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:44:06,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:06,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 141 transitions. [2022-07-22 12:44:06,365 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-22 12:44:06,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 141 transitions. [2022-07-22 12:44:06,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:44:06,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-07-22 12:44:06,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 141 transitions. [2022-07-22 12:44:06,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:06,368 INFO L220 hiAutomatonCegarLoop]: Abstraction has 57 states and 141 transitions. [2022-07-22 12:44:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 141 transitions. [2022-07-22 12:44:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-07-22 12:44:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 48 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 126 transitions. [2022-07-22 12:44:06,373 INFO L242 hiAutomatonCegarLoop]: Abstraction has 49 states and 126 transitions. [2022-07-22 12:44:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:44:06,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:44:06,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:44:06,377 INFO L87 Difference]: Start difference. First operand 49 states and 126 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:44:06,462 INFO L93 Difference]: Finished difference Result 99 states and 245 transitions. [2022-07-22 12:44:06,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 245 transitions. [2022-07-22 12:44:06,464 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:44:06,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 92 states and 231 transitions. [2022-07-22 12:44:06,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2022-07-22 12:44:06,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-07-22 12:44:06,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 231 transitions. [2022-07-22 12:44:06,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:06,467 INFO L220 hiAutomatonCegarLoop]: Abstraction has 92 states and 231 transitions. [2022-07-22 12:44:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 231 transitions. [2022-07-22 12:44:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 60. [2022-07-22 12:44:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.6333333333333333) internal successors, (158), 59 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:44:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 158 transitions. [2022-07-22 12:44:06,473 INFO L242 hiAutomatonCegarLoop]: Abstraction has 60 states and 158 transitions. [2022-07-22 12:44:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:44:06,474 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 158 transitions. [2022-07-22 12:44:06,475 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:44:06,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 158 transitions. [2022-07-22 12:44:06,476 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-22 12:44:06,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:06,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:06,476 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:06,476 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:44:06,477 INFO L748 eck$LassoCheckResult]: Stem: 1553#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1511#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1513#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 1585#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 1569#[thread1ENTRY, thread2ENTRY, L79-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 1571#[thread2ENTRY, L79-4, L44-5]don't care [573] thread2ENTRY-->L54-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 1595#[L54-5, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1597#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:06,478 INFO L750 eck$LassoCheckResult]: Loop: 1597#[L54-5, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1597#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1087091715, now seen corresponding path program 1 times [2022-07-22 12:44:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:06,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864464424] [2022-07-22 12:44:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:06,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:06,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash 929, now seen corresponding path program 5 times [2022-07-22 12:44:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:06,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659577425] [2022-07-22 12:44:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:06,525 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:06,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:06,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash -659894305, now seen corresponding path program 2 times [2022-07-22 12:44:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:06,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559182683] [2022-07-22 12:44:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:06,564 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:06,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:06,781 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:06,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:06,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:06,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:06,782 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:06,782 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:06,782 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:06,782 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:06,782 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:44:06,782 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:06,782 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:06,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:44:06,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:44:06,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:44:06,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:44:06,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:44:06,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:44:06,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:44:06,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:44:06,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:06,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:07,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:07,580 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:07,580 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:07,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:07,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:07,582 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:44:07,583 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:44:07,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:07,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:07,596 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:07,596 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Honda state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:07,618 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:44:07,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:07,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:07,619 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:44:07,619 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:44:07,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:07,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:07,633 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:07,633 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_13=0} Honda state: {v_rep#funAddr~thread1.offset_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:07,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-07-22 12:44:07,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:07,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:07,656 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:44:07,657 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:44:07,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:07,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:07,674 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:07,675 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_13=-1} Honda state: {v_rep#funAddr~thread1.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:07,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:07,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:07,704 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:44:07,705 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:44:07,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:07,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:07,719 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:07,719 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_13=-1} Honda state: {v_rep#funAddr~thread2.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:07,741 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:44:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:07,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:44:07,742 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:44:07,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:07,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:07,752 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:07,752 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1#1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:07,773 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:44:07,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:07,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:07,774 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:44:07,775 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:44:07,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:07,776 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:08,039 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:08,039 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_minus_#in~a#1=0, ~f2_3~0=0, thread1Thread1of1ForFork1_minus_#res#1=0, thread1Thread1of1ForFork1_plus_~b#1=0, thread1Thread1of1ForFork1_plus_#in~a#1=0, thread1Thread1of1ForFork1_minus_#in~b#1=0, ~f1_2~0=0, thread1Thread1of1ForFork1_minus_~b#1=0, thread1Thread1of1ForFork1_plus_~a#1=0, thread1Thread1of1ForFork1_minus_~a#1=0, thread1Thread1of1ForFork1_plus_#in~b#1=0, thread1Thread1of1ForFork1_plus_#res#1=0} Honda state: {thread1Thread1of1ForFork1_minus_#in~a#1=0, ~f2_3~0=0, thread1Thread1of1ForFork1_minus_#res#1=0, thread1Thread1of1ForFork1_plus_~b#1=0, thread1Thread1of1ForFork1_plus_#in~a#1=0, thread1Thread1of1ForFork1_minus_#in~b#1=0, ~f1_2~0=0, thread1Thread1of1ForFork1_minus_~b#1=0, thread1Thread1of1ForFork1_plus_~a#1=0, thread1Thread1of1ForFork1_minus_~a#1=0, thread1Thread1of1ForFork1_plus_#in~b#1=0, thread1Thread1of1ForFork1_plus_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:08,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:08,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:08,062 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:44:08,063 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:44:08,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:08,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:08,071 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:08,071 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~ret2#1=0} Honda state: {thread1Thread1of1ForFork1_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:08,094 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:44:08,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:08,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:08,096 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:44:08,097 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:44:08,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:08,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:08,113 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:08,113 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_13=1} Honda state: {v_rep#funAddr~thread2.offset_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:08,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:08,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:08,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:08,136 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:44:08,137 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:44:08,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:08,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:08,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-07-22 12:44:08,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:08,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:08,168 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:44:08,169 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:44:08,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:08,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:08,314 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:08,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:08,317 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:08,317 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:08,317 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:08,317 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:08,317 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:08,317 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:08,317 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:08,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:08,318 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:44:08,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:08,318 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:08,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:44:08,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:08,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:44:08,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:08,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:08,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:08,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:08,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:08,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:08,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:09,087 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:09,087 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,088 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:44:09,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:09,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:09,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:09,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:09,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:09,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:09,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:09,107 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:44:09,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:09,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-22 12:44:09,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,139 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:44:09,140 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:44:09,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:09,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:09,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:09,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:09,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:09,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:09,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:09,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:09,174 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:44:09,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,175 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:44:09,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:09,178 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:44:09,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:09,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:09,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:09,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:09,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:09,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:09,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:09,210 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:44:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,211 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:44:09,212 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:44:09,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:09,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:09,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:09,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:09,220 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-22 12:44:09,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:09,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:09,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:09,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:09,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:09,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,262 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:44:09,263 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:44:09,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:09,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:09,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:09,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:09,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:09,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:09,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:09,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:09,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:09,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:09,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,313 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:44:09,314 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:44:09,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:09,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:09,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:09,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:09,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:09,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:09,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:09,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:09,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:09,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:09,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,345 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:44:09,346 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:44:09,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:09,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:09,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:09,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:09,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:09,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:09,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:09,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:09,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:09,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,394 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:44:09,394 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:44:09,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:09,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:09,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:09,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:09,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:09,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:09,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:09,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:09,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:09,407 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:44:09,408 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:44:09,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:09,409 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:44:09,410 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:44:09,410 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:09,410 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:09,410 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:09,411 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0#1, ~n_0~0) = -1*thread1Thread1of1ForFork1_~i~0#1 + 1*~n_0~0 Supporting invariants [] [2022-07-22 12:44:09,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-22 12:44:09,433 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:09,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:09,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:09,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:09,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:09,494 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:09,494 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 158 transitions. cyclomatic complexity: 121 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:09,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 158 transitions. cyclomatic complexity: 121. 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 106 states and 277 transitions. Complement of second has 3 states. [2022-07-22 12:44:09,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:44:09,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:44:09,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:09,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:09,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:09,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:44:09,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:09,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 277 transitions. [2022-07-22 12:44:09,550 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:44:09,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 100 states and 264 transitions. [2022-07-22 12:44:09,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-07-22 12:44:09,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-07-22 12:44:09,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 264 transitions. [2022-07-22 12:44:09,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:09,559 INFO L220 hiAutomatonCegarLoop]: Abstraction has 100 states and 264 transitions. [2022-07-22 12:44:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 264 transitions. [2022-07-22 12:44:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 71. [2022-07-22 12:44:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.816901408450704) internal successors, (200), 70 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 200 transitions. [2022-07-22 12:44:09,582 INFO L242 hiAutomatonCegarLoop]: Abstraction has 71 states and 200 transitions. [2022-07-22 12:44:09,582 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 200 transitions. [2022-07-22 12:44:09,582 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:44:09,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 200 transitions. [2022-07-22 12:44:09,584 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:44:09,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:09,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:09,584 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:09,584 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:44:09,588 INFO L748 eck$LassoCheckResult]: Stem: 1819#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1775#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1777#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 1847#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 1833#[thread1ENTRY, thread2ENTRY, L79-4]don't care [573] thread2ENTRY-->L54-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 1787#[thread1ENTRY, L54-5, L79-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 1789#[L54-5, L79-4, L44-5]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 1881#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:09,589 INFO L750 eck$LassoCheckResult]: Loop: 1881#[L54-5, L79-4, L44-5]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 1881#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1087155887, now seen corresponding path program 1 times [2022-07-22 12:44:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:09,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268990216] [2022-07-22 12:44:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:09,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:09,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash 931, now seen corresponding path program 3 times [2022-07-22 12:44:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:09,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928612988] [2022-07-22 12:44:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:09,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:09,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:09,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:09,672 INFO L85 PathProgramCache]: Analyzing trace with hash -657904971, now seen corresponding path program 2 times [2022-07-22 12:44:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:09,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866610684] [2022-07-22 12:44:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:09,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:09,730 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:44:09,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:09,979 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:09,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:09,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:09,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:09,980 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:09,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:09,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:09,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:09,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:44:09,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:09,981 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:09,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:09,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:09,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:44:09,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:44:10,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:44:10,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:44:10,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:44:10,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:44:10,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,730 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:10,730 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:10,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:10,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:10,731 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:44:10,732 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:44:10,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:10,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:10,763 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:44:10,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:10,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:10,764 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:44:10,765 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:44:10,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:10,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:10,922 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:10,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:10,924 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:10,925 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:10,925 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:10,925 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:10,925 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:10,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:10,925 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:10,925 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:10,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:44:10,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:10,925 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:10,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,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:44:10,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,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:44:10,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:10,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:44:11,682 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:11,683 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:11,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:11,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:11,684 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:44:11,685 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:44:11,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:11,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:11,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:11,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:11,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:11,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:11,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:11,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:11,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:11,698 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:44:11,699 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:44:11,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:11,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:11,700 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:44:11,701 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:44:11,701 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:11,701 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:11,701 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:11,701 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~n_0~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~n_0~0 Supporting invariants [] [2022-07-22 12:44:11,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-07-22 12:44:11,723 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:11,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:11,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:11,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:11,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:11,780 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:11,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 200 transitions. cyclomatic complexity: 158 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:11,834 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 200 transitions. cyclomatic complexity: 158. 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 127 states and 365 transitions. Complement of second has 3 states. [2022-07-22 12:44:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:44:11,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:44:11,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:11,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:11,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:11,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:44:11,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:11,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 365 transitions. [2022-07-22 12:44:11,839 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:44:11,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 124 states and 360 transitions. [2022-07-22 12:44:11,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-22 12:44:11,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2022-07-22 12:44:11,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 360 transitions. [2022-07-22 12:44:11,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:11,843 INFO L220 hiAutomatonCegarLoop]: Abstraction has 124 states and 360 transitions. [2022-07-22 12:44:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 360 transitions. [2022-07-22 12:44:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2022-07-22 12:44:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 3.0) internal successors, (312), 103 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 312 transitions. [2022-07-22 12:44:11,850 INFO L242 hiAutomatonCegarLoop]: Abstraction has 104 states and 312 transitions. [2022-07-22 12:44:11,850 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 312 transitions. [2022-07-22 12:44:11,850 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:44:11,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 312 transitions. [2022-07-22 12:44:11,852 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:44:11,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:11,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:11,852 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:11,853 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:44:11,854 INFO L748 eck$LassoCheckResult]: Stem: 2142#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2086#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 2088#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 2174#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 2156#[thread1ENTRY, thread2ENTRY, L79-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 2158#[thread2ENTRY, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 2224#[thread2ENTRY, L79-4, L44-5]don't care [573] thread2ENTRY-->L54-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 2252#[L54-5, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 2198#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:11,854 INFO L750 eck$LassoCheckResult]: Loop: 2198#[L54-5, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 2198#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash -659592055, now seen corresponding path program 3 times [2022-07-22 12:44:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:11,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407621158] [2022-07-22 12:44:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:11,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:11,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash 929, now seen corresponding path program 6 times [2022-07-22 12:44:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:11,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006811169] [2022-07-22 12:44:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:11,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:11,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:11,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1027483673, now seen corresponding path program 4 times [2022-07-22 12:44:11,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:11,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087589266] [2022-07-22 12:44:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:11,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:11,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:12,192 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:12,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:12,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:12,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:12,193 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:12,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:12,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:12,194 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:12,194 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:44:12,194 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:12,194 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:12,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:12,965 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:12,965 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:12,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:12,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:12,967 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:44:12,967 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:44:12,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:12,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:12,977 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:12,978 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1#1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:12,999 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:44:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:13,003 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:44:13,003 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:44:13,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:13,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:13,017 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:13,017 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Honda state: {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:13,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-07-22 12:44:13,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:13,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:13,044 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:44:13,045 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:44:13,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:13,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:13,057 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:13,058 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_17=0} Honda state: {v_rep#funAddr~thread1.offset_17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:13,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-22 12:44:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:13,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:13,080 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:44:13,081 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:44:13,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:13,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:13,095 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:13,095 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_17=1} Honda state: {v_rep#funAddr~thread2.offset_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:13,116 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:44:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:13,117 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:44:13,119 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:44:13,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:13,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:13,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:13,133 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_17=-1} Honda state: {v_rep#funAddr~thread2.base_17=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:13,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2022-07-22 12:44:13,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:13,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:13,156 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:44:13,160 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:44:13,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:13,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:13,172 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:13,173 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_17=-1} Honda state: {v_rep#funAddr~thread1.base_17=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:13,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2022-07-22 12:44:13,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:13,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:13,195 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:44:13,196 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:44:13,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:13,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:13,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:13,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:13,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:13,229 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:44:13,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:13,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:13,237 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:44:13,382 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:13,385 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:44:13,385 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:13,385 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:13,385 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:13,385 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:13,385 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:13,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:13,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:13,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:13,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:44:13,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:13,386 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:13,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:13,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:44:13,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:13,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:44:13,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:44:13,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:13,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:13,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:13,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:13,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:44:13,610 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:44:14,171 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:14,172 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:14,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:14,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:14,177 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:44:14,182 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:44:14,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:14,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:14,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:14,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:14,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:14,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:14,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:14,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:14,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:14,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2022-07-22 12:44:14,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:14,214 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:14,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:14,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-22 12:44:14,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:14,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:14,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:14,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:14,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:14,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:14,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:14,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:14,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:14,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:14,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:14,249 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:14,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:14,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-22 12:44:14,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:14,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:14,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:14,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:14,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:14,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:14,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:14,285 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:44:14,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:14,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:14,286 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:14,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-22 12:44:14,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:14,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:14,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:14,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:14,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:14,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:14,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:14,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:14,321 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:44:14,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:14,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:14,322 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:14,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-22 12:44:14,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:14,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:14,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:14,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:14,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:14,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:14,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:14,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:14,334 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:14,337 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:44:14,337 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:44:14,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:14,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:14,338 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:14,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-22 12:44:14,339 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:14,339 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:14,339 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:14,339 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0#1, ~n_0~0) = -1*thread1Thread1of1ForFork1_~i~0#1 + 1*~n_0~0 Supporting invariants [] [2022-07-22 12:44:14,361 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:44:14,362 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:14,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:14,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:14,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:14,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:14,425 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:14,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 312 transitions. cyclomatic complexity: 247 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:14,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 312 transitions. cyclomatic complexity: 247. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 148 states and 418 transitions. Complement of second has 3 states. [2022-07-22 12:44:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:44:14,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:14,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:14,473 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:44:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:14,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:14,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:14,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:14,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:14,533 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:14,533 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 312 transitions. cyclomatic complexity: 247 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:14,570 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 312 transitions. cyclomatic complexity: 247. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 148 states and 418 transitions. Complement of second has 3 states. [2022-07-22 12:44:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:44:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:14,572 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:44:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:14,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:14,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:14,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:14,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:14,627 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:14,627 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 312 transitions. cyclomatic complexity: 247 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:14,665 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 312 transitions. cyclomatic complexity: 247. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 135 states and 408 transitions. Complement of second has 2 states. [2022-07-22 12:44:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-07-22 12:44:14,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:14,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:14,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:44:14,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:14,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:44:14,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:14,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 408 transitions. [2022-07-22 12:44:14,670 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 14 [2022-07-22 12:44:14,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 127 states and 355 transitions. [2022-07-22 12:44:14,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2022-07-22 12:44:14,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-07-22 12:44:14,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 355 transitions. [2022-07-22 12:44:14,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:14,674 INFO L220 hiAutomatonCegarLoop]: Abstraction has 127 states and 355 transitions. [2022-07-22 12:44:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 355 transitions. [2022-07-22 12:44:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2022-07-22 12:44:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 2.6989247311827955) internal successors, (251), 92 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 251 transitions. [2022-07-22 12:44:14,680 INFO L242 hiAutomatonCegarLoop]: Abstraction has 93 states and 251 transitions. [2022-07-22 12:44:14,680 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 251 transitions. [2022-07-22 12:44:14,680 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:44:14,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 251 transitions. [2022-07-22 12:44:14,682 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 10 [2022-07-22 12:44:14,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:14,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:14,683 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:14,683 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:44:14,684 INFO L748 eck$LassoCheckResult]: Stem: 2815#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2817#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 2829#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 2887#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 2855#[thread1ENTRY, thread2ENTRY, L79-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 2857#[thread2ENTRY, L79-4, L44-5]don't care [573] thread2ENTRY-->L54-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 2965#[L54-5, L79-4, L44-5]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 2939#[L54-5, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 2961#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:14,684 INFO L750 eck$LassoCheckResult]: Loop: 2961#[L54-5, L79-4, L44-5]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 2959#[L54-5, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 2961#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:14,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash -659894243, now seen corresponding path program 1 times [2022-07-22 12:44:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:14,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185723397] [2022-07-22 12:44:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:14,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:14,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:14,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash 29759, now seen corresponding path program 1 times [2022-07-22 12:44:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265995506] [2022-07-22 12:44:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:14,782 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:14,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1496821083, now seen corresponding path program 2 times [2022-07-22 12:44:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:14,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295990744] [2022-07-22 12:44:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:14,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:14,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:15,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-22 12:44:15,704 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:15,704 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:15,704 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:15,704 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:15,704 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:15,705 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:15,705 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:15,705 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:15,705 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:44:15,705 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:15,705 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:15,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,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:44:15,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:44:15,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:44:15,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:44:15,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:15,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:16,934 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:16,934 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:16,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:16,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:16,937 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:16,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:16,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:16,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-22 12:44:16,967 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:44:16,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:16,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:16,969 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:16,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-22 12:44:16,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:16,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:17,153 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:17,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:17,156 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:17,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:17,156 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:17,156 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:17,156 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:17,156 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:17,156 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:17,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:17,157 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:44:17,157 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:17,157 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:17,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:17,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:18,366 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:18,366 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:18,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:18,367 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:18,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-22 12:44:18,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:18,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:18,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:18,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:18,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:18,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:18,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:18,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:18,378 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:18,382 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:44:18,382 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:44:18,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:18,384 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:18,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-22 12:44:18,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:18,385 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:18,385 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:18,385 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread2Thread1of1ForFork0_~i~1#1) = 1*~n_0~0 - 1*thread2Thread1of1ForFork0_~i~1#1 Supporting invariants [] [2022-07-22 12:44:18,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:18,410 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:18,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:18,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:18,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:18,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:18,518 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:44:18,518 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 251 transitions. cyclomatic complexity: 187 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:18,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 251 transitions. cyclomatic complexity: 187. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 164 states and 443 transitions. Complement of second has 3 states. [2022-07-22 12:44:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:44:18,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:44:18,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:18,561 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:44:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:18,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:18,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:18,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:18,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:18,638 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:44:18,638 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 251 transitions. cyclomatic complexity: 187 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:18,695 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 251 transitions. cyclomatic complexity: 187. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 191 states and 515 transitions. Complement of second has 5 states. [2022-07-22 12:44:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-07-22 12:44:18,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:44:18,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:18,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:44:18,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:18,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:44:18,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:18,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 515 transitions. [2022-07-22 12:44:18,700 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 20 [2022-07-22 12:44:18,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 184 states and 492 transitions. [2022-07-22 12:44:18,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2022-07-22 12:44:18,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-07-22 12:44:18,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 492 transitions. [2022-07-22 12:44:18,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:44:18,704 INFO L220 hiAutomatonCegarLoop]: Abstraction has 184 states and 492 transitions. [2022-07-22 12:44:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 492 transitions. [2022-07-22 12:44:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 124. [2022-07-22 12:44:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 2.903225806451613) internal successors, (360), 123 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 360 transitions. [2022-07-22 12:44:18,712 INFO L242 hiAutomatonCegarLoop]: Abstraction has 124 states and 360 transitions. [2022-07-22 12:44:18,712 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 360 transitions. [2022-07-22 12:44:18,712 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:44:18,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 360 transitions. [2022-07-22 12:44:18,714 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 14 [2022-07-22 12:44:18,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:18,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:18,714 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:18,714 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:44:18,715 INFO L748 eck$LassoCheckResult]: Stem: 3440#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3442#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 3454#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 3512#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 3480#[thread1ENTRY, thread2ENTRY, L79-4]don't care [573] thread2ENTRY-->L54-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 3484#[thread1ENTRY, L54-5, L79-4]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 3486#[thread1ENTRY, L54-5, L79-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 3488#[L54-5, L79-4, L44-5]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 3652#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:18,716 INFO L750 eck$LassoCheckResult]: Loop: 3652#[L54-5, L79-4, L44-5]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 3652#[L54-5, L79-4, L44-5]don't care [2022-07-22 12:44:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -657536691, now seen corresponding path program 3 times [2022-07-22 12:44:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:18,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320139576] [2022-07-22 12:44:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:18,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:18,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:18,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 931, now seen corresponding path program 4 times [2022-07-22 12:44:18,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:18,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849588592] [2022-07-22 12:44:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:18,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:18,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:18,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1091199959, now seen corresponding path program 4 times [2022-07-22 12:44:18,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:18,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909191366] [2022-07-22 12:44:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:18,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:18,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:19,026 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:19,026 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:19,026 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:19,026 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:19,026 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:19,026 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:19,026 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:19,027 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:19,027 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:44:19,027 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:19,027 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:19,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:19,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:19,788 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:19,788 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:19,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:19,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:19,790 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:19,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-22 12:44:19,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:19,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:19,799 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:44:19,799 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~ret7#1=0} Honda state: {thread2Thread1of1ForFork0_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:44:19,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:19,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:19,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:19,823 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:19,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-22 12:44:19,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:19,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:19,853 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:44:19,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:19,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:19,854 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:19,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-07-22 12:44:19,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:19,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:20,012 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:20,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:20,015 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:20,015 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:20,015 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:20,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:20,016 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:20,016 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:20,016 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:20,016 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:20,016 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:44:20,016 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:20,016 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:20,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:20,771 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:20,771 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:20,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:20,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:20,773 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:20,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-07-22 12:44:20,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:20,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:20,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:20,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:20,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:20,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:20,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:20,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:20,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:20,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:20,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:20,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:20,807 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:20,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:20,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-07-22 12:44:20,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:20,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:20,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:20,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:20,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:20,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:20,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:20,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:20,822 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:44:20,822 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:44:20,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:20,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:20,823 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:20,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-07-22 12:44:20,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:20,824 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:20,824 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:20,824 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~n_0~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~n_0~0 Supporting invariants [] [2022-07-22 12:44:20,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2022-07-22 12:44:20,849 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:20,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:20,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:20,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:20,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:20,917 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:20,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 360 transitions. cyclomatic complexity: 275 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:20,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 360 transitions. cyclomatic complexity: 275. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 152 states and 432 transitions. Complement of second has 3 states. [2022-07-22 12:44:20,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:44:20,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:20,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:20,957 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:44:20,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:20,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:20,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:21,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:21,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:21,017 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:21,017 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 360 transitions. cyclomatic complexity: 275 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:21,052 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 360 transitions. cyclomatic complexity: 275. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 152 states and 432 transitions. Complement of second has 3 states. [2022-07-22 12:44:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:44:21,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:21,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:21,054 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:44:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:21,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:21,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:21,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:21,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:21,109 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:44:21,110 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 360 transitions. cyclomatic complexity: 275 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:21,147 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 360 transitions. cyclomatic complexity: 275. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 168 states and 474 transitions. Complement of second has 2 states. [2022-07-22 12:44:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:44:21,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:44:21,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:21,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:44:21,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:21,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:44:21,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:21,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 474 transitions. [2022-07-22 12:44:21,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-22 12:44:21,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 114 states and 269 transitions. [2022-07-22 12:44:21,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-22 12:44:21,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:44:21,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 269 transitions. [2022-07-22 12:44:21,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:21,154 INFO L220 hiAutomatonCegarLoop]: Abstraction has 114 states and 269 transitions. [2022-07-22 12:44:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 269 transitions. [2022-07-22 12:44:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 80. [2022-07-22 12:44:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.4125) internal successors, (193), 79 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 193 transitions. [2022-07-22 12:44:21,181 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 193 transitions. [2022-07-22 12:44:21,181 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 193 transitions. [2022-07-22 12:44:21,181 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 12:44:21,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 193 transitions. [2022-07-22 12:44:21,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:44:21,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:21,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:21,183 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:44:21,183 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:44:21,184 INFO L748 eck$LassoCheckResult]: Stem: 4248#[ULTIMATE.startENTRY]don't care [897] ULTIMATE.startENTRY-->L78-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) (= (select |v_#valid_85| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33| 1) |v_#valid_84|) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_59| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_33| 4) |v_#length_59|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= (select .cse1 1) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select |v_#valid_85| 2) 1) (= (ite (and (= v_~f1_2~0_89 v_~f1_6~0_95) (= v_~f2_3~0_91 v_~f2_7~0_79)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 0) (= (select |v_#valid_85| 0) 0) (= 16 (select |v_#length_60| 2)) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_55|) (= (select |v_#length_60| 1) 2) (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_52|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_25|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~f1_6~0=v_~f1_6~0_95, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_32|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_22|, ~f1_2~0=v_~f1_2~0_89, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~n_0~0=v_~n_0~0_69, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, #length=|v_#length_59|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_15|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ~f2_3~0=v_~f2_3~0_91, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_32|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_16|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_32|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_55|, ~f2_7~0=v_~f2_7~0_79, ~l_8~0=v_~l_8~0_43, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ~l_4~0=v_~l_4~0_37, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~f1_6~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem21#1, ~f1_2~0, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n_0~0, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, #length, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet10#1, ~f2_3~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, #valid, #memory_int, ~f2_7~0, ~l_8~0, ULTIMATE.start_main_#t~nondet19#1, ~l_4~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4250#[L78-3]don't care [647] L78-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_10|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_12|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_6|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_12|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_12|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 4252#[thread1ENTRY, L78-4]don't care [817] L78-4-->L79-3: Formula: (and (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre18#1_21| |v_#pthreadsForks_32|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_21|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_21|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 4290#[thread1ENTRY, L79-3]don't care [644] L79-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre18#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_6|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_12|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_8|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_8|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_8|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_12|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_6|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_6|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_10|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ite8#1, thread2Thread1of1ForFork0_#t~ret6#1] 4266#[thread1ENTRY, thread2ENTRY, L79-4]don't care [504] thread1ENTRY-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 4268#[thread2ENTRY, L79-4, L44-5]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 4338#[thread2ENTRY, L79-4, L44-5]don't care [573] thread2ENTRY-->L54-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 4340#[L54-5, L79-4, L44-5]don't care [760] L79-4-->L80-1: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_13|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_13|) (select |v_#length_25| |v_ULTIMATE.start_main_~#t1~0#1.base_15|)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) 1) (= |v_ULTIMATE.start_main_#t~mem20#1_10| (select (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_13|))) InVars {#valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, 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~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_7|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet19#1] 4350#[L54-5, L44-5, L80-1]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 4318#[L54-5, L44-5, L80-1]don't care [2022-07-22 12:44:21,185 INFO L750 eck$LassoCheckResult]: Loop: 4318#[L54-5, L44-5, L80-1]don't care [898] L44-5-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|))) (and (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|) (= (+ (* (- 1) |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|) |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= v_~f2_3~0_In_3 |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_2| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (= v_~f1_2~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_2| 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_In_5| v_~n_0~0_In_7) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| 0) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| 2147483648))) 1 0) 0)) (= v_~f1_2~0_Out_2 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= v_~f2_3~0_Out_6 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14| 0)) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|))) InVars {~f1_2~0=v_~f1_2~0_In_5, ~f2_3~0=v_~f2_3~0_In_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, ~n_0~0=v_~n_0~0_In_7} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_2|, ~f2_3~0=v_~f2_3~0_Out_6, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_6|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_2|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_Out_6|, ~f1_2~0=v_~f1_2~0_Out_2, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~n_0~0=v_~n_0~0_In_7, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_14|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ~f2_3~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, ~f1_2~0, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 4316#[L54-5, L44-5, L80-1]don't care [900] L54-5-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61|))) (and (< |v_thread2Thread1of1ForFork0_~i~1#1_54| v_~n_0~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_45| v_~f1_6~0_99) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_63| 0)) 1 0) 0)) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_61| 0) (<= .cse0 2147483647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_29| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~b#1_61| |v_thread2Thread1of1ForFork0_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| v_~f2_7~0_84) (= |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_#in~a#1_29|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_31| |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_29| v_~f1_6~0_100) (= |v_thread2Thread1of1ForFork0_~i~1#1_53| (+ |v_thread2Thread1of1ForFork0_~i~1#1_54| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| (+ (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_63|) |v_thread2Thread1of1ForFork0_minus_~a#1_59|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_63|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_63|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| v_~f1_6~0_99) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_25| |v_thread2Thread1of1ForFork0_minus_~a#1_59|) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_61| |v_thread2Thread1of1ForFork0_plus_~b#1_61| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_61|)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#res#1_41| v_~f2_7~0_83))) InVars {~n_0~0=v_~n_0~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_54|, ~f2_7~0=v_~f2_7~0_84, ~f1_6~0=v_~f1_6~0_100} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_29|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_63|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_61|, thread2Thread1of1ForFork0_#t~ret7#1=|v_thread2Thread1of1ForFork0_#t~ret7#1_29|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, ~f1_6~0=v_~f1_6~0_99, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_21|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_29|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_25|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_45|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_61|, ~n_0~0=v_~n_0~0_73, ~f2_7~0=v_~f2_7~0_83, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_31|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~ret7#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~f2_7~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 4318#[L54-5, L44-5, L80-1]don't care [2022-07-22 12:44:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1027479397, now seen corresponding path program 1 times [2022-07-22 12:44:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:21,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960813104] [2022-07-22 12:44:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:21,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:21,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash 29699, now seen corresponding path program 2 times [2022-07-22 12:44:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:21,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011204174] [2022-07-22 12:44:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:21,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:21,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash -434748825, now seen corresponding path program 2 times [2022-07-22 12:44:21,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:21,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485262189] [2022-07-22 12:44:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:21,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:21,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:21,286 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:21,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:21,914 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:21,914 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:21,914 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:21,914 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:21,914 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:44:21,914 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:21,914 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:21,914 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:21,914 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:44:21,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:21,915 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:21,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:44:21,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:44:21,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:21,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:44:21,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:21,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:21,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:21,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:22,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:22,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:22,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:22,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:22,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:22,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:22,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,155 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:23,155 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:44:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:23,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:23,157 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:23,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:44:23,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:23,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-07-22 12:44:23,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:23,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:23,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:23,225 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:23,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:44:23,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:44:23,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-07-22 12:44:23,511 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:44:23,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2022-07-22 12:44:23,513 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:23,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:23,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:23,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:23,513 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:23,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:23,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:23,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:23,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:44:23,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:23,514 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:23,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,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:44:23,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:44:23,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:44:23,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,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:44:23,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:44:23,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:23,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:44:23,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:44:24,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:24,752 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:24,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:24,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:24,758 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:24,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:24,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:24,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:24,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:24,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:24,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:24,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:24,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:24,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-07-22 12:44:24,782 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:44:24,785 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:44:24,785 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:44:24,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:24,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:24,787 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:24,789 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:44:24,789 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:44:24,789 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:44:24,789 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~n_0~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~n_0~0 Supporting invariants [] [2022-07-22 12:44:24,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-07-22 12:44:24,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2022-07-22 12:44:24,825 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:44:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:24,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:44:24,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:44:24,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:44:24,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:44:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:44:24,897 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:44:24,897 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 193 transitions. cyclomatic complexity: 136 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:24,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 193 transitions. cyclomatic complexity: 136. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 125 states and 321 transitions. Complement of second has 4 states. [2022-07-22 12:44:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:44:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:44:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-07-22 12:44:24,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:44:24,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:24,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 12:44:24,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:24,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-22 12:44:24,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:44:24,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 321 transitions. [2022-07-22 12:44:24,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:44:24,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 0 states and 0 transitions. [2022-07-22 12:44:24,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 12:44:24,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 12:44:24,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 12:44:24,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:44:24,937 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:44:24,937 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:44:24,937 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:44:24,937 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 12:44:24,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 12:44:24,958 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:44:24,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 12:44:24,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:44:24 BoogieIcfgContainer [2022-07-22 12:44:24,968 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:44:24,969 INFO L158 Benchmark]: Toolchain (without parser) took 45239.53ms. Allocated memory was 153.1MB in the beginning and 241.2MB in the end (delta: 88.1MB). Free memory was 126.9MB in the beginning and 203.7MB in the end (delta: -76.8MB). Peak memory consumption was 147.8MB. Max. memory is 8.0GB. [2022-07-22 12:44:24,969 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:44:24,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.92ms. Allocated memory is still 153.1MB. Free memory was 126.7MB in the beginning and 116.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:44:24,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.88ms. Allocated memory is still 153.1MB. Free memory was 115.9MB in the beginning and 113.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:44:24,970 INFO L158 Benchmark]: Boogie Preprocessor took 31.68ms. Allocated memory is still 153.1MB. Free memory was 113.9MB in the beginning and 112.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:44:24,970 INFO L158 Benchmark]: RCFGBuilder took 837.40ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 132.0MB in the end (delta: -19.5MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. [2022-07-22 12:44:24,971 INFO L158 Benchmark]: BuchiAutomizer took 43887.14ms. Allocated memory was 153.1MB in the beginning and 241.2MB in the end (delta: 88.1MB). Free memory was 132.0MB in the beginning and 203.7MB in the end (delta: -71.7MB). Peak memory consumption was 151.3MB. Max. memory is 8.0GB. [2022-07-22 12:44:24,973 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.92ms. Allocated memory is still 153.1MB. Free memory was 126.7MB in the beginning and 116.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.88ms. Allocated memory is still 153.1MB. Free memory was 115.9MB in the beginning and 113.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.68ms. Allocated memory is still 153.1MB. Free memory was 113.9MB in the beginning and 112.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 837.40ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 132.0MB in the end (delta: -19.5MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 43887.14ms. Allocated memory was 153.1MB in the beginning and 241.2MB in the end (delta: 88.1MB). Free memory was 132.0MB in the beginning and 203.7MB in the end (delta: -71.7MB). Peak memory consumption was 151.3MB. 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 13 terminating modules (1 trivial, 10 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * i + n_0 and consists of 2 locations. One deterministic module has affine ranking function -1 * i + n_0 and consists of 2 locations. One deterministic module has affine ranking function n_0 + -1 * i and consists of 2 locations. One deterministic module has affine ranking function -1 * i + n_0 and consists of 2 locations. One deterministic module has affine ranking function -1 * i + n_0 and consists of 2 locations. One deterministic module has affine ranking function n_0 + -1 * i and consists of 2 locations. One deterministic module has affine ranking function -1 * i + n_0 and consists of 2 locations. One deterministic module has affine ranking function n_0 + -1 * i and consists of 2 locations. One deterministic module has affine ranking function n_0 + -1 * i and consists of 3 locations. One deterministic module has affine ranking function n_0 + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + n_0 and consists of 2 locations. One nondeterministic module has affine ranking function n_0 + -1 * i and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.6s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 34.9s. Construction of modules took 0.4s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 1. Automata minimization 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 268 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [9, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 487 IncrementalHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 54 mSDtfsCounter, 487 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT11 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax123 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf90 smp100 dnf1316 smp15 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 53 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.7s InitialAbstractionConstructionTime: 6.2s - 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: 6.1s, 207 PlacesBefore, 20 PlacesAfterwards, 216 TransitionsBefore, 15 TransitionsAfterwards, 11592 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 128 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 41 ConcurrentYvCompositions, 14 ChoiceCompositions, 251 TotalNumberOfCompositions, 9487 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9487, positive: 9487, positive conditional: 0, positive unconditional: 9487, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6544, positive: 6544, positive conditional: 0, positive unconditional: 6544, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9487, positive: 2943, positive conditional: 0, positive unconditional: 2943, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6544, unknown conditional: 0, unknown unconditional: 6544] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2022-07-22 12:44:25,016 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:44:25,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...