/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:26:05,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:26:05,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:26:05,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:26:05,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:26:05,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:26:05,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:26:05,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:26:05,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:26:05,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:26:05,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:26:05,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:26:05,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:26:05,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:26:05,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:26:05,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:26:05,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:26:05,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:26:05,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:26:05,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:26:05,311 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:26:05,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:26:05,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:26:05,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:26:05,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:26:05,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:26:05,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:26:05,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:26:05,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:26:05,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:26:05,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:26:05,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:26:05,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:26:05,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:26:05,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:26:05,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:26:05,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:26:05,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:26:05,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:26:05,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:26:05,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:26:05,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:26:05,357 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:26:05,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:26:05,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:26:05,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:26:05,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:26:05,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:26:05,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:26:05,405 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:26:05,406 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:26:05,406 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:26:05,407 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:26:05,407 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:26:05,407 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:26:05,407 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:26:05,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:26:05,408 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:26:05,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:26:05,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:26:05,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:26:05,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:26:05,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:26:05,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:26:05,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:26:05,409 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:26:05,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:26:05,410 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:26:05,410 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:26:05,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:26:05,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:26:05,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:26:05,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:26:05,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:26:05,414 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:26:05,414 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:26:05,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:26:05,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:26:05,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:26:05,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:26:05,844 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:26:05,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-07-22 12:26:05,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84922b693/a600768f60d1435bb615c1ff5a8bfde1/FLAG587422c95 [2022-07-22 12:26:06,461 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:26:06,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-07-22 12:26:06,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84922b693/a600768f60d1435bb615c1ff5a8bfde1/FLAG587422c95 [2022-07-22 12:26:06,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84922b693/a600768f60d1435bb615c1ff5a8bfde1 [2022-07-22 12:26:06,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:26:06,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:26:06,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:26:06,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:26:06,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:26:06,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:26:06" (1/1) ... [2022-07-22 12:26:06,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686b8a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:06, skipping insertion in model container [2022-07-22 12:26:06,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:26:06" (1/1) ... [2022-07-22 12:26:06,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:26:06,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:26:07,067 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/test-easy11.wvr.c[2005,2018] [2022-07-22 12:26:07,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:26:07,078 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:26:07,100 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/test-easy11.wvr.c[2005,2018] [2022-07-22 12:26:07,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:26:07,118 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:26:07,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07 WrapperNode [2022-07-22 12:26:07,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:26:07,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:26:07,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:26:07,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:26:07,128 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:26:07" (1/1) ... [2022-07-22 12:26:07,137 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:26:07" (1/1) ... [2022-07-22 12:26:07,159 INFO L137 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-07-22 12:26:07,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:26:07,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:26:07,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:26:07,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:26:07,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (1/1) ... [2022-07-22 12:26:07,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (1/1) ... [2022-07-22 12:26:07,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (1/1) ... [2022-07-22 12:26:07,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (1/1) ... [2022-07-22 12:26:07,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (1/1) ... [2022-07-22 12:26:07,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (1/1) ... [2022-07-22 12:26:07,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (1/1) ... [2022-07-22 12:26:07,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:26:07,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:26:07,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:26:07,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:26:07,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (1/1) ... [2022-07-22 12:26:07,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:07,229 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:26:07,252 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:26:07,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:26:07,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:26:07,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:26:07,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:26:07,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:26:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:26:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:26:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:26:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:26:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:26:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:26:07,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:26:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:26:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:26:07,294 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:26:07,375 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:26:07,376 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:26:07,674 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:26:07,692 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:26:07,692 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 12:26:07,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:26:07 BoogieIcfgContainer [2022-07-22 12:26:07,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:26:07,697 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:26:07,697 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:26:07,701 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:26:07,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:26:07,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:26:06" (1/3) ... [2022-07-22 12:26:07,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dc39a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:26:07, skipping insertion in model container [2022-07-22 12:26:07,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:26:07,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:26:07" (2/3) ... [2022-07-22 12:26:07,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dc39a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:26:07, skipping insertion in model container [2022-07-22 12:26:07,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:26:07,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:26:07" (3/3) ... [2022-07-22 12:26:07,706 INFO L322 chiAutomizerObserver]: Analyzing ICFG test-easy11.wvr.c [2022-07-22 12:26:07,826 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:26:07,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 190 flow [2022-07-22 12:26:08,040 INFO L129 PetriNetUnfolder]: 6/83 cut-off events. [2022-07-22 12:26:08,043 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:26:08,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 83 events. 6/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2022-07-22 12:26:08,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 87 transitions, 190 flow [2022-07-22 12:26:08,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 178 flow [2022-07-22 12:26:08,071 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:26:08,090 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 83 transitions, 178 flow [2022-07-22 12:26:08,100 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 83 transitions, 178 flow [2022-07-22 12:26:08,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 178 flow [2022-07-22 12:26:08,144 INFO L129 PetriNetUnfolder]: 6/83 cut-off events. [2022-07-22 12:26:08,144 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:26:08,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 83 events. 6/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2022-07-22 12:26:08,149 INFO L116 LiptonReduction]: Number of co-enabled transitions 572 [2022-07-22 12:26:10,873 INFO L131 LiptonReduction]: Checked pairs total: 496 [2022-07-22 12:26:10,874 INFO L133 LiptonReduction]: Total number of compositions: 82 [2022-07-22 12:26:10,898 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:26:10,898 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:26:10,899 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:26:10,899 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:26:10,899 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:26:10,899 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:26:10,899 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:26:10,899 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:26:10,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:26:10,938 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:26:10,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:10,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:10,945 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:26:10,945 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:10,945 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:26:10,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33 states, but on-demand construction may add more states [2022-07-22 12:26:10,951 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:26:10,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:10,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:10,952 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:26:10,952 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:10,957 INFO L748 eck$LassoCheckResult]: Stem: 89#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 92#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 94#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 96#[L43-2, L73-4]don't care [2022-07-22 12:26:10,957 INFO L750 eck$LassoCheckResult]: Loop: 96#[L43-2, L73-4]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 96#[L43-2, L73-4]don't care [2022-07-22 12:26:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 329993, now seen corresponding path program 1 times [2022-07-22 12:26:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:10,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145986166] [2022-07-22 12:26:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:11,104 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:11,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 1 times [2022-07-22 12:26:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910131395] [2022-07-22 12:26:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:11,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:11,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash 10230066, now seen corresponding path program 1 times [2022-07-22 12:26:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:11,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408599711] [2022-07-22 12:26:11,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:11,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:11,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:11,264 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:11,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:11,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:11,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:11,266 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:11,267 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,267 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:11,267 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:11,267 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:26:11,267 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:11,268 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:11,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:26:11,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:11,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:11,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:11,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:11,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:11,368 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:11,369 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:11,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:11,378 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:26:11,391 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:26:11,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:11,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:11,414 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:11,414 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:11,449 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:26:11,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:11,452 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:26:11,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:11,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:11,475 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:26:11,485 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:11,486 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:11,542 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:26:11,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:11,551 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:26:11,558 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:26:11,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:11,559 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:11,622 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:26:11,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:11,625 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:26:11,633 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:26:11,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:11,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:11,687 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:11,692 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:26:11,693 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:11,693 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:11,693 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:11,693 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:11,693 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:11,694 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,694 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:11,694 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:11,694 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:26:11,694 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:11,694 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:11,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:11,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:26:11,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:26:11,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:26:11,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:26:11,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:11,773 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:11,779 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:11,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:11,781 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:26:11,789 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:26:11,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:11,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:11,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:11,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:11,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:11,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:11,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:11,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:11,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:11,823 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:26:11,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:11,825 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:26:11,827 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:26:11,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:11,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:11,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:11,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:11,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:11,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:11,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:11,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:11,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:11,880 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:11,880 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:11,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:11,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:11,883 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:26:11,921 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:26:11,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:11,921 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:11,922 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:11,922 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:12,015 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:26:12,018 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:12,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:12,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:12,106 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:12,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:12,107 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:26:12,147 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:26:12,150 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:26:12,262 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:26:12,265 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:26:12,270 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:26:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:26:12,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:26:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:26:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:26:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:12,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 161 transitions. [2022-07-22 12:26:12,297 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:26:12,297 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:26:12,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 52 states and 135 transitions. [2022-07-22 12:26:12,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:26:12,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-22 12:26:12,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 135 transitions. [2022-07-22 12:26:12,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:12,314 INFO L220 hiAutomatonCegarLoop]: Abstraction has 52 states and 135 transitions. [2022-07-22 12:26:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 135 transitions. [2022-07-22 12:26:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-07-22 12:26:12,355 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:26:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 104 transitions. [2022-07-22 12:26:12,365 INFO L242 hiAutomatonCegarLoop]: Abstraction has 40 states and 104 transitions. [2022-07-22 12:26:12,365 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 104 transitions. [2022-07-22 12:26:12,366 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:26:12,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 104 transitions. [2022-07-22 12:26:12,370 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:26:12,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:12,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:12,379 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:26:12,379 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:12,380 INFO L748 eck$LassoCheckResult]: Stem: 309#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 311#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 321#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 281#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 287#[L43-2, L74-3]don't care [2022-07-22 12:26:12,380 INFO L750 eck$LassoCheckResult]: Loop: 287#[L43-2, L74-3]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 287#[L43-2, L74-3]don't care [2022-07-22 12:26:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash 10230069, now seen corresponding path program 1 times [2022-07-22 12:26:12,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:12,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296178428] [2022-07-22 12:26:12,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:12,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:12,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 2 times [2022-07-22 12:26:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:12,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543654575] [2022-07-22 12:26:12,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:12,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:12,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 317132422, now seen corresponding path program 1 times [2022-07-22 12:26:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:12,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125457431] [2022-07-22 12:26:12,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:12,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:12,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:12,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:12,563 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:12,564 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:12,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:12,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:12,564 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:12,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:12,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:12,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:12,564 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:26:12,565 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:12,565 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:12,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:12,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:12,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:26:12,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:12,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:12,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:12,633 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:12,633 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:12,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:12,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:12,637 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:26:12,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:12,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:12,662 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:26:12,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:12,672 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:12,711 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:26:12,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:12,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:12,713 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:26:12,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:12,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:12,734 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:26:12,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:12,740 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:26:12,781 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:26:12,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:12,782 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:26:12,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:12,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:12,805 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:26:12,809 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:12,809 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:26:12,849 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:26:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:12,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:12,851 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:26:12,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:12,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:12,870 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:26:12,875 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:12,876 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:26:12,916 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:26:12,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:12,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:12,917 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:26:12,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:12,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:12,934 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:26:12,982 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:26:12,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:12,984 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:26:12,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:12,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:13,004 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:26:13,049 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:13,057 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:26:13,057 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:13,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:13,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:13,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:13,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:13,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:13,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:13,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:26:13,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:13,059 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:13,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,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:26:13,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,120 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:13,121 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:13,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,122 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:26:13,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:13,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:13,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:13,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:13,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:13,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:13,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:13,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:13,144 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:26:13,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:13,187 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:26:13,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,188 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:26:13,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:13,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:13,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:13,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:13,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:13,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:13,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:13,210 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:26:13,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:13,237 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:26:13,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,238 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:26:13,239 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:26:13,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:13,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:13,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:13,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:13,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:13,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:13,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:13,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:13,312 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:26:13,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,313 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:26:13,315 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:26:13,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:13,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:13,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:13,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:13,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:13,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:13,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:13,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:13,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:13,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,387 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:26:13,390 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:26:13,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:13,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:13,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:13,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:13,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:13,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:13,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:13,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:13,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:13,419 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:13,419 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:13,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,421 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:26:13,429 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:26:13,429 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:13,429 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:13,429 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:13,429 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:13,455 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:26:13,456 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:13,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:13,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:13,502 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:13,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:13,502 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:26:13,503 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:26:13,503 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:26:13,525 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:26:13,526 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:26:13,527 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:26:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2022-07-22 12:26:13,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:26:13,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:13,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:26:13,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:13,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:26:13,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:13,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 115 transitions. [2022-07-22 12:26:13,530 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:26:13,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 115 transitions. [2022-07-22 12:26:13,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:26:13,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-07-22 12:26:13,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 115 transitions. [2022-07-22 12:26:13,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:13,533 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 115 transitions. [2022-07-22 12:26:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 115 transitions. [2022-07-22 12:26:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-22 12:26:13,537 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:26:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 101 transitions. [2022-07-22 12:26:13,538 INFO L242 hiAutomatonCegarLoop]: Abstraction has 39 states and 101 transitions. [2022-07-22 12:26:13,538 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 101 transitions. [2022-07-22 12:26:13,538 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:26:13,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 101 transitions. [2022-07-22 12:26:13,540 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:26:13,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:13,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:13,540 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:26:13,541 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:13,541 INFO L748 eck$LassoCheckResult]: Stem: 463#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 465#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 475#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 437#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 443#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 427#[thread2ENTRY, L43-2, L74-4]don't care [2022-07-22 12:26:13,541 INFO L750 eck$LassoCheckResult]: Loop: 427#[thread2ENTRY, L43-2, L74-4]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 427#[thread2ENTRY, L43-2, L74-4]don't care [2022-07-22 12:26:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash 317132357, now seen corresponding path program 1 times [2022-07-22 12:26:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:13,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756999062] [2022-07-22 12:26:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:13,562 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:13,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 3 times [2022-07-22 12:26:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:13,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357968790] [2022-07-22 12:26:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:13,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:13,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:13,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1241168758, now seen corresponding path program 1 times [2022-07-22 12:26:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:13,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482042026] [2022-07-22 12:26:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:13,606 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:13,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:13,634 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:13,634 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:13,634 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:13,634 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:13,634 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:13,634 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,634 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:13,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:13,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:26:13,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:13,635 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:13,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,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:26:13,685 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:13,686 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,687 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:26:13,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:13,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:13,712 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:26:13,715 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:13,715 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:26:13,749 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:26:13,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,751 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:26:13,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:13,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:13,767 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:26:13,808 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:26:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,809 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:26:13,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:13,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:13,828 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:26:13,873 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:13,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:13,877 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:13,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:13,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:13,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:13,877 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:13,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:13,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:13,877 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:26:13,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:13,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:13,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:13,945 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:13,945 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:13,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:13,947 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:26:13,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:13,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:13,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:13,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:13,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:13,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:13,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:13,976 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:26:13,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:14,018 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:26:14,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,021 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:26:14,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:14,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:14,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:14,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:14,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:14,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:14,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:14,043 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:26:14,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:14,094 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:26:14,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,096 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:26:14,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:14,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:14,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:14,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:14,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:14,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:14,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:14,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:14,113 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:26:14,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:14,127 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:14,127 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:14,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,130 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:26:14,139 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:14,139 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:14,139 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:14,139 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:14,152 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:26:14,184 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:26:14,185 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:14,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:14,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:14,229 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:14,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:14,229 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:26:14,230 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:26:14,230 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:26:14,262 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 47 states and 125 transitions. Complement of second has 3 states. [2022-07-22 12:26:14,262 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:26:14,264 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:26:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2022-07-22 12:26:14,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:26:14,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:14,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:26:14,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:14,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:26:14,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:14,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 125 transitions. [2022-07-22 12:26:14,270 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:26:14,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 125 transitions. [2022-07-22 12:26:14,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-22 12:26:14,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-22 12:26:14,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 125 transitions. [2022-07-22 12:26:14,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:14,278 INFO L220 hiAutomatonCegarLoop]: Abstraction has 47 states and 125 transitions. [2022-07-22 12:26:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 125 transitions. [2022-07-22 12:26:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-07-22 12:26:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 37 states have internal predecessors, (97), 0 states have call successors, (0), 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:26:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 97 transitions. [2022-07-22 12:26:14,293 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 97 transitions. [2022-07-22 12:26:14,293 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 97 transitions. [2022-07-22 12:26:14,293 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:26:14,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 97 transitions. [2022-07-22 12:26:14,294 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:26:14,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:14,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:14,295 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:26:14,295 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:14,296 INFO L748 eck$LassoCheckResult]: Stem: 622#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 624#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 634#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 606#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 610#[thread2ENTRY, L74-4, thread1ENTRY]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 636#[L74-4, L56-2, thread1ENTRY]don't care [2022-07-22 12:26:14,296 INFO L750 eck$LassoCheckResult]: Loop: 636#[L74-4, L56-2, thread1ENTRY]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 636#[L74-4, L56-2, thread1ENTRY]don't care [2022-07-22 12:26:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 317168695, now seen corresponding path program 1 times [2022-07-22 12:26:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:14,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728309149] [2022-07-22 12:26:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:14,342 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:14,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 1 times [2022-07-22 12:26:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:14,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48198279] [2022-07-22 12:26:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:14,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:14,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:14,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1242295235, now seen corresponding path program 1 times [2022-07-22 12:26:14,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:14,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438550525] [2022-07-22 12:26:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:14,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:14,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:14,458 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:14,458 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:14,458 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:14,458 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:14,458 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:14,459 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,459 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:14,459 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:14,459 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:26:14,459 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:14,459 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:14,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:26:14,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:14,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:26:14,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:14,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:26:14,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:14,511 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:14,511 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:14,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,512 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:26:14,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:14,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:14,534 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:26:14,539 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:14,539 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:26:14,574 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:26:14,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,576 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:26:14,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:14,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:14,593 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:26:14,597 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:14,597 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:26:14,626 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:26:14,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,628 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:26:14,631 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:26:14,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:14,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:14,640 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:14,640 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post2=0} Honda state: {thread2Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:14,663 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:26:14,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,664 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:26:14,665 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:26:14,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:14,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:14,678 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:14,678 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:26:14,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:14,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,701 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:26:14,701 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:26:14,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:14,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:14,732 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:26:14,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,734 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:26:14,734 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:26:14,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:14,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:14,771 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:14,773 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:26:14,773 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:14,774 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:14,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:14,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:14,774 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:14,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:14,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:14,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:26:14,775 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:14,775 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:14,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:26:14,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:14,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:14,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:14,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:26:14,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:14,855 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:26:14,879 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:14,879 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:14,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,885 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:26:14,895 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:26:14,895 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:26:14,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:14,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:14,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:14,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:14,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:14,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:14,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:14,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:14,958 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:26:14,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,959 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:26:14,965 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:26:14,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:14,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:14,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:14,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:14,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:14,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:14,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:14,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:14,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:14,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 12:26:14,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:14,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:14,998 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:26:14,999 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:26:15,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:15,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:15,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:15,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:15,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:15,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:15,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:15,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:15,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:15,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,040 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:26:15,041 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:26:15,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:15,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:15,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:15,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:15,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:15,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:15,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:15,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:15,084 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:26:15,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,085 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:26:15,086 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:26:15,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:15,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:15,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:15,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:15,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:15,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:15,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:15,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:15,100 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:15,102 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:15,102 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:15,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,103 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:26:15,104 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:26:15,105 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:15,105 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:15,105 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:15,105 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:26:15,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 12:26:15,129 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:15,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:15,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:15,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:15,177 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:15,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:26:15,179 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:26:15,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 97 transitions. cyclomatic complexity: 77 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:26:15,216 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 97 transitions. cyclomatic complexity: 77. 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 63 states and 162 transitions. Complement of second has 3 states. [2022-07-22 12:26:15,217 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:26:15,218 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:26:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:26:15,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:26:15,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:15,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:26:15,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:15,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:26:15,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:15,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 162 transitions. [2022-07-22 12:26:15,221 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:26:15,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 60 states and 158 transitions. [2022-07-22 12:26:15,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-22 12:26:15,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:26:15,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 158 transitions. [2022-07-22 12:26:15,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:15,224 INFO L220 hiAutomatonCegarLoop]: Abstraction has 60 states and 158 transitions. [2022-07-22 12:26:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 158 transitions. [2022-07-22 12:26:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-07-22 12:26:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.6122448979591835) internal successors, (128), 48 states have internal predecessors, (128), 0 states have call successors, (0), 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:26:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 128 transitions. [2022-07-22 12:26:15,229 INFO L242 hiAutomatonCegarLoop]: Abstraction has 49 states and 128 transitions. [2022-07-22 12:26:15,229 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 128 transitions. [2022-07-22 12:26:15,229 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:26:15,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 128 transitions. [2022-07-22 12:26:15,231 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:26:15,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:15,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:15,231 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:26:15,231 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:15,232 INFO L748 eck$LassoCheckResult]: Stem: 797#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 799#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 821#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 773#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 779#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 761#[thread2ENTRY, L43-2, L74-4]don't care [276] L74-4-->L75-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_37| |v_ULTIMATE.start_main_~#t1~0#1.base_25|)) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~mem8#1_14| (select (select |v_#memory_int_31| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|))) InVars {#valid=|v_#valid_62|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_14|, #valid=|v_#valid_62|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet7#1] 765#[thread2ENTRY, L75-1, L43-2]don't care [2022-07-22 12:26:15,232 INFO L750 eck$LassoCheckResult]: Loop: 765#[thread2ENTRY, L75-1, L43-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 765#[thread2ENTRY, L75-1, L43-2]don't care [2022-07-22 12:26:15,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1241168751, now seen corresponding path program 1 times [2022-07-22 12:26:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:15,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541883315] [2022-07-22 12:26:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 4 times [2022-07-22 12:26:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:15,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204533443] [2022-07-22 12:26:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:15,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:15,278 INFO L85 PathProgramCache]: Analyzing trace with hash -178474100, now seen corresponding path program 1 times [2022-07-22 12:26:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:15,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793112296] [2022-07-22 12:26:15,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:15,317 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:15,317 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:15,317 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:15,317 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:15,317 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:15,317 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,317 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:15,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:15,317 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:26:15,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:15,318 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:15,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:26:15,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:26:15,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:26:15,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,365 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:15,365 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:15,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,366 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:26:15,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:15,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:15,392 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:26:15,395 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:15,395 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:26:15,427 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:26:15,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,428 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:26:15,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:15,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:15,444 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:26:15,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:15,449 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:26:15,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:15,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,482 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:26:15,483 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:26:15,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:15,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:15,504 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:15,505 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:15,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 12:26:15,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,527 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:26:15,531 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:26:15,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:15,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:15,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:15,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,565 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:26:15,566 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:26:15,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:15,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:15,602 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:15,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 12:26:15,604 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:15,605 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:15,605 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:15,605 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:15,605 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:15,605 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,605 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:15,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:15,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:26:15,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:15,605 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:15,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:15,669 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:15,670 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:15,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,671 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:26:15,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:15,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:15,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:15,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:15,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:15,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:15,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:15,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:15,699 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:26:15,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:15,736 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:26:15,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,737 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:26:15,738 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:26:15,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:15,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:15,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:15,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:15,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:15,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:15,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:15,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:15,774 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:26:15,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,775 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:26:15,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:15,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:15,789 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:26:15,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:15,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:15,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:15,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:15,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:15,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:15,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:15,793 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:15,794 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:15,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:15,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:15,795 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:26:15,798 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:26:15,798 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:15,798 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:15,798 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:15,798 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:15,820 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:26:15,821 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:15,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:15,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:15,860 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:15,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:15,861 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:26:15,861 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:26:15,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 128 transitions. cyclomatic complexity: 103 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:26:15,894 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 128 transitions. cyclomatic complexity: 103. 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 67 states and 171 transitions. Complement of second has 3 states. [2022-07-22 12:26:15,894 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:26:15,895 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:26:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:26:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:26:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:26:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:26:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:15,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 171 transitions. [2022-07-22 12:26:15,898 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:26:15,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 62 states and 161 transitions. [2022-07-22 12:26:15,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-22 12:26:15,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-07-22 12:26:15,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 161 transitions. [2022-07-22 12:26:15,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:15,901 INFO L220 hiAutomatonCegarLoop]: Abstraction has 62 states and 161 transitions. [2022-07-22 12:26:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 161 transitions. [2022-07-22 12:26:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-07-22 12:26:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 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:26:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 122 transitions. [2022-07-22 12:26:15,906 INFO L242 hiAutomatonCegarLoop]: Abstraction has 47 states and 122 transitions. [2022-07-22 12:26:15,906 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 122 transitions. [2022-07-22 12:26:15,906 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:26:15,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 122 transitions. [2022-07-22 12:26:15,907 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:26:15,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:15,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:15,908 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:15,908 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:15,909 INFO L748 eck$LassoCheckResult]: Stem: 993#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 995#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1019#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 967#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 973#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 955#[thread2ENTRY, L43-2, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 957#[L43-2, L74-4, L56-2]don't care [259] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork0_~x~1_31 10000)) (= |v_thread2Thread1of1ForFork0_#res.base_7| 0) (= v_~Y~0_33 (+ v_~Y~0_34 v_thread2Thread1of1ForFork0_~x~1_31)) (= |v_thread2Thread1of1ForFork0_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_31, ~Y~0=v_~Y~0_34} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_7|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_7|, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_31, ~Y~0=v_~Y~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, ~Y~0] 953#[L43-2, L74-4, thread2EXIT]don't care [2022-07-22 12:26:15,909 INFO L750 eck$LassoCheckResult]: Loop: 953#[L43-2, L74-4, thread2EXIT]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 953#[L43-2, L74-4, thread2EXIT]don't care [2022-07-22 12:26:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -178475736, now seen corresponding path program 1 times [2022-07-22 12:26:15,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:15,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351572020] [2022-07-22 12:26:15,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:15,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,923 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 5 times [2022-07-22 12:26:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:15,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032255537] [2022-07-22 12:26:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:15,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:15,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1237780237, now seen corresponding path program 1 times [2022-07-22 12:26:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:15,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429595990] [2022-07-22 12:26:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:15,996 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:26:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:26:15,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429595990] [2022-07-22 12:26:15,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429595990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:26:15,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:26:15,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:26:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288424012] [2022-07-22 12:26:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:26:16,010 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:16,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:16,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:16,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:16,011 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:16,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:16,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:16,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:26:16,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:16,011 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:16,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:16,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:16,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:16,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:26:16,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:26:16,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:26:16,060 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:16,061 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:16,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,062 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:26:16,065 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:26:16,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:16,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:16,080 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:16,080 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_11=1} Honda state: {v_rep#funAddr~thread2.offset_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:16,102 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:26:16,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,103 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:26:16,103 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:26:16,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:16,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:16,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:16,122 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:26:16,144 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:26:16,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,145 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:26:16,146 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:26:16,148 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:16,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:16,156 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:16,157 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:16,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-22 12:26:16,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,180 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:26:16,183 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:26:16,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:16,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:16,213 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:26:16,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,215 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:26:16,215 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:26:16,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:16,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:16,251 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:16,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-22 12:26:16,253 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:16,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:16,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:16,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:16,254 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:16,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,254 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:16,254 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:16,254 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:26:16,254 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:16,254 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:16,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:16,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:16,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:16,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:16,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:16,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:26:16,322 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:16,323 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:16,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,324 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:26:16,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:16,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:16,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:16,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:16,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:16,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:16,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:16,347 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:26:16,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:16,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:16,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,389 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:26:16,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:26:16,403 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:26:16,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:16,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:16,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:16,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:16,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:16,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:16,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:16,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-22 12:26:16,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,455 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:26:16,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:16,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:16,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:16,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:16,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:16,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:16,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:16,485 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:26:16,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:16,526 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:26:16,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,527 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:26:16,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:26:16,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:16,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:16,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:16,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:16,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:16,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:16,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:16,541 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:26:16,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:16,581 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:26:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,583 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:26:16,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:16,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:16,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:16,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:16,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:16,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:16,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:16,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:16,599 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:26:16,607 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:16,613 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:16,613 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:16,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:16,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:16,616 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:26:16,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:16,617 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:16,618 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:16,618 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:16,633 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:26:16,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:16,653 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:16,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:16,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:16,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:16,708 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:16,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:16,708 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:26:16,709 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:26:16,709 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 122 transitions. cyclomatic complexity: 98 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:26:16,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 122 transitions. cyclomatic complexity: 98. 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 49 states and 124 transitions. Complement of second has 2 states. [2022-07-22 12:26:16,734 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:26:16,735 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:26:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:26:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:26:16,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:16,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:16,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:26:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:16,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 124 transitions. [2022-07-22 12:26:16,737 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2022-07-22 12:26:16,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 45 states and 111 transitions. [2022-07-22 12:26:16,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-22 12:26:16,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-22 12:26:16,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 111 transitions. [2022-07-22 12:26:16,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:16,739 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:26:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 111 transitions. [2022-07-22 12:26:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-22 12:26:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 44 states have internal predecessors, (111), 0 states have call successors, (0), 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:26:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 111 transitions. [2022-07-22 12:26:16,743 INFO L242 hiAutomatonCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:26:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:26:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:26:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:26:16,747 INFO L87 Difference]: Start difference. First operand 45 states and 111 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:26:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:26:16,828 INFO L93 Difference]: Finished difference Result 54 states and 134 transitions. [2022-07-22 12:26:16,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 134 transitions. [2022-07-22 12:26:16,830 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:26:16,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 134 transitions. [2022-07-22 12:26:16,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 12:26:16,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-22 12:26:16,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 134 transitions. [2022-07-22 12:26:16,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:16,832 INFO L220 hiAutomatonCegarLoop]: Abstraction has 54 states and 134 transitions. [2022-07-22 12:26:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 134 transitions. [2022-07-22 12:26:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-07-22 12:26:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 44 states have internal predecessors, (111), 0 states have call successors, (0), 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:26:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 111 transitions. [2022-07-22 12:26:16,836 INFO L242 hiAutomatonCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:26:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 12:26:16,837 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:26:16,837 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:26:16,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 111 transitions. [2022-07-22 12:26:16,838 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2022-07-22 12:26:16,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:16,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:16,839 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:16,839 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:16,839 INFO L748 eck$LassoCheckResult]: Stem: 1286#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1288#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1322#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 1324#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1352#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1334#[thread2ENTRY, L43-2, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 1336#[L43-2, L74-4, L56-2]don't care [264] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_7| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_7| 0) (= v_~Y~0_43 (+ v_~Y~0_44 v_thread1Thread1of1ForFork1_~x~0_33)) (not (< v_thread1Thread1of1ForFork1_~x~0_33 10000))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_33, ~Y~0=v_~Y~0_44} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_7|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_33, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_7|, ~Y~0=v_~Y~0_43} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, ~Y~0] 1306#[thread1EXIT, L74-4, L56-2]don't care [2022-07-22 12:26:16,840 INFO L750 eck$LassoCheckResult]: Loop: 1306#[thread1EXIT, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1306#[thread1EXIT, L74-4, L56-2]don't care [2022-07-22 12:26:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash -178475731, now seen corresponding path program 1 times [2022-07-22 12:26:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:16,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002115618] [2022-07-22 12:26:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:16,890 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:16,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 2 times [2022-07-22 12:26:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:16,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416985664] [2022-07-22 12:26:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:16,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:16,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1237780083, now seen corresponding path program 1 times [2022-07-22 12:26:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:16,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125063523] [2022-07-22 12:26:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:16,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:17,003 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:26:17,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:26:17,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125063523] [2022-07-22 12:26:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125063523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:26:17,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:26:17,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:26:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384048815] [2022-07-22 12:26:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:26:17,012 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:26:17,027 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:17,027 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:17,027 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:17,027 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:17,027 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:17,027 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,028 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:17,028 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:17,028 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:26:17,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:17,028 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:17,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,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:26:17,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,051 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:26:17,087 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:17,087 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:17,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,089 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:26:17,090 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:26:17,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:17,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:17,099 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post2=0} Honda state: {thread2Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:17,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 12:26:17,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,123 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:26:17,124 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:26:17,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:17,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,138 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:17,138 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:26:17,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:17,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,161 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:26:17,161 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:26:17,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:17,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,175 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:17,175 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:26:17,197 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:26:17,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,198 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:26:17,199 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:26:17,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:17,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,213 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:17,213 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:26:17,234 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:26:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,235 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:26:17,236 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:26:17,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:17,237 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:17,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,269 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:26:17,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:17,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,286 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:26:17,310 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:17,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:17,312 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:17,313 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:17,313 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:17,313 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:17,313 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:17,313 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,313 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:17,313 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:17,313 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:26:17,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:17,313 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:17,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,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:26:17,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:26:17,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:26:17,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:26:17,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,373 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:17,374 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:17,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,375 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:26:17,378 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:26:17,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:17,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:17,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:17,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:17,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:17,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:17,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:17,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:17,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:17,412 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:26:17,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,415 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:26:17,415 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:26:17,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:17,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:17,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:17,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:17,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:17,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:17,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:17,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:17,465 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:26:17,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,467 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:26:17,470 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:26:17,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:26:17,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:17,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:17,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:17,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:17,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:17,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:17,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:17,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:17,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,528 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:26:17,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:17,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:17,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:17,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:17,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:17,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:17,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:17,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:17,542 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:26:17,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:17,554 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:17,554 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:17,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,556 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:26:17,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:17,563 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:17,563 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:17,563 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:26:17,577 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:26:17,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 12:26:17,594 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:17,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:17,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:17,641 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:17,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:17,642 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:26:17,643 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:26:17,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 111 transitions. cyclomatic complexity: 87 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:26:17,673 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 111 transitions. cyclomatic complexity: 87. 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 56 states and 131 transitions. Complement of second has 3 states. [2022-07-22 12:26:17,674 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:26:17,674 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:26:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2022-07-22 12:26:17,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:26:17,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:17,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:17,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:17,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:26:17,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:17,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 131 transitions. [2022-07-22 12:26:17,677 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-22 12:26:17,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 131 transitions. [2022-07-22 12:26:17,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:26:17,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 12:26:17,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 131 transitions. [2022-07-22 12:26:17,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:17,679 INFO L220 hiAutomatonCegarLoop]: Abstraction has 56 states and 131 transitions. [2022-07-22 12:26:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 131 transitions. [2022-07-22 12:26:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2022-07-22 12:26:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 44 states have internal predecessors, (111), 0 states have call successors, (0), 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:26:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 111 transitions. [2022-07-22 12:26:17,683 INFO L242 hiAutomatonCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:26:17,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:26:17,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:26:17,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:26:17,684 INFO L87 Difference]: Start difference. First operand 45 states and 111 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:26:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:26:17,755 INFO L93 Difference]: Finished difference Result 89 states and 211 transitions. [2022-07-22 12:26:17,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 211 transitions. [2022-07-22 12:26:17,757 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:26:17,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 84 states and 201 transitions. [2022-07-22 12:26:17,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-07-22 12:26:17,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-07-22 12:26:17,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 201 transitions. [2022-07-22 12:26:17,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:17,759 INFO L220 hiAutomatonCegarLoop]: Abstraction has 84 states and 201 transitions. [2022-07-22 12:26:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 201 transitions. [2022-07-22 12:26:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 57. [2022-07-22 12:26:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.543859649122807) internal successors, (145), 56 states have internal predecessors, (145), 0 states have call successors, (0), 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:26:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 145 transitions. [2022-07-22 12:26:17,765 INFO L242 hiAutomatonCegarLoop]: Abstraction has 57 states and 145 transitions. [2022-07-22 12:26:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:26:17,766 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 145 transitions. [2022-07-22 12:26:17,766 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:26:17,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 145 transitions. [2022-07-22 12:26:17,767 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2022-07-22 12:26:17,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:17,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:17,767 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:17,767 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:17,768 INFO L748 eck$LassoCheckResult]: Stem: 1658#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1660#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1700#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 1702#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1728#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1710#[thread2ENTRY, L43-2, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 1678#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 1684#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:17,768 INFO L750 eck$LassoCheckResult]: Loop: 1684#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1684#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -178475712, now seen corresponding path program 1 times [2022-07-22 12:26:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:17,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798075731] [2022-07-22 12:26:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:17,780 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:17,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 3 times [2022-07-22 12:26:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:17,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916037856] [2022-07-22 12:26:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:17,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:17,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:17,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1237779494, now seen corresponding path program 1 times [2022-07-22 12:26:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:17,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319444995] [2022-07-22 12:26:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:17,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:17,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:17,827 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:17,827 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:17,827 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:17,827 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:17,827 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:17,828 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,828 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:17,828 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:17,828 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:26:17,828 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:17,828 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:17,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,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:26:17,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:17,875 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:17,875 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:17,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,877 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:26:17,878 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:26:17,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:17,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,892 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:17,892 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_15=-1} Honda state: {v_rep#funAddr~thread2.base_15=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:17,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:17,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,914 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:26:17,915 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:26:17,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:17,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,930 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:17,930 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_15=1} Honda state: {v_rep#funAddr~thread2.offset_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:17,952 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:26:17,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,953 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:26:17,954 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:26:17,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:17,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:17,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:17,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:17,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:17,996 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:26:17,997 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:26:17,998 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:17,998 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:18,037 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:18,040 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:26:18,040 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:18,040 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:18,040 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:18,040 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:18,040 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:18,040 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:18,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:18,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:26:18,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:18,041 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:18,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:26:18,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:26:18,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,095 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:18,096 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:18,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,097 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:26:18,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:18,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:18,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:18,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:18,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:18,106 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:26:18,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:18,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:18,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:18,139 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:26:18,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,141 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:26:18,142 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:26:18,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:18,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:18,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:18,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:18,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:18,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:18,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:18,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:18,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:18,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,176 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:26:18,177 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:26:18,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:18,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:18,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:18,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:18,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:18,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:18,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:18,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:18,217 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:26:18,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,219 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:26:18,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:18,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:18,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:18,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:18,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:18,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:18,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:18,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:18,235 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:26:18,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:18,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:18,245 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:18,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,246 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:26:18,251 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:18,251 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:18,251 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:18,251 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:26:18,264 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:26:18,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:18,284 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:18,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:18,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:18,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:18,331 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:18,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:18,331 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:26:18,333 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:26:18,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 145 transitions. cyclomatic complexity: 111 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:26:18,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 145 transitions. cyclomatic complexity: 111. 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 94 states and 241 transitions. Complement of second has 3 states. [2022-07-22 12:26:18,367 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:26:18,369 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:26:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:26:18,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:26:18,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:18,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:18,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:18,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:26:18,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:18,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 241 transitions. [2022-07-22 12:26:18,373 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:26:18,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 241 transitions. [2022-07-22 12:26:18,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 12:26:18,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-07-22 12:26:18,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 241 transitions. [2022-07-22 12:26:18,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:18,379 INFO L220 hiAutomatonCegarLoop]: Abstraction has 94 states and 241 transitions. [2022-07-22 12:26:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 241 transitions. [2022-07-22 12:26:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2022-07-22 12:26:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.6911764705882355) internal successors, (183), 67 states have internal predecessors, (183), 0 states have call successors, (0), 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:26:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 183 transitions. [2022-07-22 12:26:18,388 INFO L242 hiAutomatonCegarLoop]: Abstraction has 68 states and 183 transitions. [2022-07-22 12:26:18,388 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 183 transitions. [2022-07-22 12:26:18,388 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:26:18,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 183 transitions. [2022-07-22 12:26:18,389 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:26:18,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:18,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:18,390 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:18,390 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:18,390 INFO L748 eck$LassoCheckResult]: Stem: 1900#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1902#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1948#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1952#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1964#[thread2ENTRY, L74-4, thread1ENTRY]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 1966#[L74-4, L56-2, thread1ENTRY]don't care [276] L74-4-->L75-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_37| |v_ULTIMATE.start_main_~#t1~0#1.base_25|)) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~mem8#1_14| (select (select |v_#memory_int_31| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|))) InVars {#valid=|v_#valid_62|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_14|, #valid=|v_#valid_62|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet7#1] 1982#[L75-1, L56-2, thread1ENTRY]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1910#[L75-1, L56-2, thread1ENTRY]don't care [2022-07-22 12:26:18,391 INFO L750 eck$LassoCheckResult]: Loop: 1910#[L75-1, L56-2, thread1ENTRY]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1910#[L75-1, L56-2, thread1ENTRY]don't care [2022-07-22 12:26:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash -143553283, now seen corresponding path program 1 times [2022-07-22 12:26:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:18,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756416725] [2022-07-22 12:26:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:18,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:18,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:18,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:18,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 4 times [2022-07-22 12:26:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:18,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491161279] [2022-07-22 12:26:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:18,450 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:18,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -155184195, now seen corresponding path program 2 times [2022-07-22 12:26:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:18,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238282201] [2022-07-22 12:26:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:18,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:18,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:18,511 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:18,511 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:18,511 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:18,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:18,511 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:18,511 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,511 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:18,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:18,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:26:18,512 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:18,512 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:18,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,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:26:18,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:26:18,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,557 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:18,557 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:18,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,559 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:26:18,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:18,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:18,580 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:26:18,587 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:18,587 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:26:18,620 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:26:18,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,622 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:26:18,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:18,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:18,639 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:26:18,645 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:18,645 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:26:18,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,681 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:26:18,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:18,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:18,695 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:26:18,704 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:18,704 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post2=0} Honda state: {thread2Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:18,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:18,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,738 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:26:18,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:18,741 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:18,756 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:26:18,761 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:18,761 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:26:18,793 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:26:18,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,794 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:26:18,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:18,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:18,807 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:26:18,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-22 12:26:18,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,835 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:26:18,836 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:26:18,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:18,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:18,901 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:18,904 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:26:18,904 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:18,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:18,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:18,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:18,905 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:18,905 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:18,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:18,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:26:18,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:18,905 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:18,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:18,963 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:18,963 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:18,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:18,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:18,965 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:26:18,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:18,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:18,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:18,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:18,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:18,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:18,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:19,002 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:26:19,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:19,048 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:26:19,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,049 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:26:19,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:19,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:19,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:19,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:19,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:19,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:19,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:19,069 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:26:19,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-22 12:26:19,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:19,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,128 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:26:19,129 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:26:19,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:19,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:19,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:19,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:19,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:19,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:19,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:19,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:19,145 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:26:19,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:19,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:19,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,187 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:26:19,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:19,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:19,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:19,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:19,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:19,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:19,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:19,204 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:26:19,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:19,244 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:26:19,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,246 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:26:19,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:19,255 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:26:19,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:19,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:19,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:19,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:19,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:19,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:19,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:19,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:19,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,307 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:26:19,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:19,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:19,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:19,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:19,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:19,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:19,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:19,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:19,321 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:26:19,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:19,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:19,334 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:19,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,335 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:26:19,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:19,337 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:19,337 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:19,337 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:26:19,340 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:26:19,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:19,360 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:19,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:19,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:19,407 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:19,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:19,408 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:26:19,409 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:26:19,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 183 transitions. cyclomatic complexity: 142 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:26:19,449 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 183 transitions. cyclomatic complexity: 142. 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 131 states and 353 transitions. Complement of second has 3 states. [2022-07-22 12:26:19,450 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:26:19,451 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:26:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:26:19,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:26:19,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:19,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:19,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:19,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:26:19,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:19,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 353 transitions. [2022-07-22 12:26:19,457 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:26:19,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 128 states and 348 transitions. [2022-07-22 12:26:19,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2022-07-22 12:26:19,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-22 12:26:19,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 348 transitions. [2022-07-22 12:26:19,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:19,463 INFO L220 hiAutomatonCegarLoop]: Abstraction has 128 states and 348 transitions. [2022-07-22 12:26:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 348 transitions. [2022-07-22 12:26:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 97. [2022-07-22 12:26:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 2.6804123711340204) internal successors, (260), 96 states have internal predecessors, (260), 0 states have call successors, (0), 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:26:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 260 transitions. [2022-07-22 12:26:19,486 INFO L242 hiAutomatonCegarLoop]: Abstraction has 97 states and 260 transitions. [2022-07-22 12:26:19,486 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 260 transitions. [2022-07-22 12:26:19,486 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:26:19,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 260 transitions. [2022-07-22 12:26:19,488 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:26:19,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:19,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:19,489 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:19,489 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:19,490 INFO L748 eck$LassoCheckResult]: Stem: 2215#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2217#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 2251#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 2253#[L43-2, L73-4]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 2285#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 2289#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 2263#[thread2ENTRY, L43-2, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 2265#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 2319#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:19,490 INFO L750 eck$LassoCheckResult]: Loop: 2319#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 2319#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:19,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1238531863, now seen corresponding path program 2 times [2022-07-22 12:26:19,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:19,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932277880] [2022-07-22 12:26:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:19,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:19,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 6 times [2022-07-22 12:26:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:19,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543142582] [2022-07-22 12:26:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:19,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:19,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:19,526 INFO L85 PathProgramCache]: Analyzing trace with hash 260218194, now seen corresponding path program 3 times [2022-07-22 12:26:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:19,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233079267] [2022-07-22 12:26:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:19,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:19,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:19,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:19,573 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:19,573 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:19,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:19,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:19,574 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:19,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:19,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:19,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:26:19,574 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:19,575 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:19,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,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:26:19,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,628 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:19,629 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:19,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,630 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:26:19,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:19,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:19,653 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:26:19,656 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:19,656 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_19=0} Honda state: {v_rep#funAddr~thread1.offset_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:19,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:19,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,690 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:26:19,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:19,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:19,703 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:26:19,707 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:19,708 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_19=-1} Honda state: {v_rep#funAddr~thread2.base_19=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:19,729 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:26:19,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,730 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:26:19,731 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:26:19,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:19,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:19,747 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:19,747 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_19=-1} Honda state: {v_rep#funAddr~thread1.base_19=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:19,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:19,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,770 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:26:19,771 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:26:19,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:19,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:19,785 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:19,785 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_19=1} Honda state: {v_rep#funAddr~thread2.offset_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:19,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:19,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,807 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:26:19,808 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:26:19,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:19,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:19,817 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:19,817 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:19,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-22 12:26:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,840 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:26:19,842 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:26:19,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:19,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:19,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-22 12:26:19,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,872 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:26:19,874 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:26:19,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:19,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:19,908 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:19,910 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:26:19,910 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:19,910 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:19,910 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:19,911 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:19,911 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:19,911 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,911 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:19,911 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:19,911 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:26:19,911 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:19,911 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:19,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:19,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:26:19,970 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:19,970 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:19,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:19,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:19,971 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:26:19,985 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:26:19,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:19,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:19,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:19,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:19,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:19,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:19,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:20,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:20,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-22 12:26:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,026 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:26:20,027 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:26:20,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:20,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:20,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:20,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:20,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:20,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:20,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:20,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:20,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:20,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,067 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:26:20,068 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:26:20,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:20,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:20,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:20,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:20,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:20,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:20,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:20,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:20,109 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:26:20,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,111 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:26:20,112 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:26:20,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:20,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:20,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:20,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:20,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:20,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:20,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:20,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:20,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-07-22 12:26:20,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,146 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:26:20,147 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:26:20,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:20,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:20,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:20,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:20,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:20,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:20,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:20,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:20,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:20,206 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:26:20,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,207 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:26:20,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:20,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:20,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:20,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:20,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:20,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:20,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:20,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:20,221 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:26:20,231 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:20,234 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:20,234 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:20,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,236 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:26:20,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:20,241 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:20,242 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:20,242 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:20,255 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:26:20,274 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:26:20,275 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,318 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,318 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:26:20,319 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:26:20,319 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197 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:26:20,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197. 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 153 states and 400 transitions. Complement of second has 3 states. [2022-07-22 12:26:20,354 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:26:20,354 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:26:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:26:20,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:20,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:20,355 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,399 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,399 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:26:20,400 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:26:20,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197 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:26:20,432 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197. 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 153 states and 400 transitions. Complement of second has 3 states. [2022-07-22 12:26:20,432 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:26:20,433 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:26:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:26:20,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:20,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:20,434 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,472 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,473 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:26:20,473 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:26:20,473 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197 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:26:20,508 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197. 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 126 states and 347 transitions. Complement of second has 2 states. [2022-07-22 12:26:20,509 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:26:20,509 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:26:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:26:20,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:20,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:20,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:26:20,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:20,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:26:20,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:20,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 347 transitions. [2022-07-22 12:26:20,512 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 15 [2022-07-22 12:26:20,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 347 transitions. [2022-07-22 12:26:20,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-22 12:26:20,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-07-22 12:26:20,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 347 transitions. [2022-07-22 12:26:20,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:20,516 INFO L220 hiAutomatonCegarLoop]: Abstraction has 126 states and 347 transitions. [2022-07-22 12:26:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 347 transitions. [2022-07-22 12:26:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2022-07-22 12:26:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 2.7281553398058254) internal successors, (281), 102 states have internal predecessors, (281), 0 states have call successors, (0), 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:26:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 281 transitions. [2022-07-22 12:26:20,521 INFO L242 hiAutomatonCegarLoop]: Abstraction has 103 states and 281 transitions. [2022-07-22 12:26:20,521 INFO L425 stractBuchiCegarLoop]: Abstraction has 103 states and 281 transitions. [2022-07-22 12:26:20,521 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:26:20,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 281 transitions. [2022-07-22 12:26:20,523 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 13 [2022-07-22 12:26:20,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:20,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:20,523 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:20,523 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:20,524 INFO L748 eck$LassoCheckResult]: Stem: 2939#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2941#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 2975#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 2979#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 2997#[thread2ENTRY, L74-4, thread1ENTRY]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 2999#[L74-4, L56-2, thread1ENTRY]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 3021#[L74-4, L56-2, thread1ENTRY]don't care [276] L74-4-->L75-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_37| |v_ULTIMATE.start_main_~#t1~0#1.base_25|)) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~mem8#1_14| (select (select |v_#memory_int_31| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|))) InVars {#valid=|v_#valid_62|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_14|, #valid=|v_#valid_62|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet7#1] 3023#[L75-1, L56-2, thread1ENTRY]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 2943#[L75-1, L56-2, thread1ENTRY]don't care [2022-07-22 12:26:20,524 INFO L750 eck$LassoCheckResult]: Loop: 2943#[L75-1, L56-2, thread1ENTRY]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 2943#[L75-1, L56-2, thread1ENTRY]don't care [2022-07-22 12:26:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash -155178615, now seen corresponding path program 3 times [2022-07-22 12:26:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:20,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872038248] [2022-07-22 12:26:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:20,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:20,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:20,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 5 times [2022-07-22 12:26:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:20,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162922193] [2022-07-22 12:26:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:20,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:20,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash -515569487, now seen corresponding path program 4 times [2022-07-22 12:26:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:20,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919320294] [2022-07-22 12:26:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:20,562 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:20,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:20,581 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:20,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:20,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:20,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:20,582 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:20,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:20,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:20,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:26:20,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:20,582 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:20,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,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:26:20,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,627 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:20,628 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:20,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,629 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:26:20,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:20,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:20,640 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:26:20,679 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:26:20,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,681 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:26:20,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:20,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:20,696 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:26:20,744 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:20,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:20,748 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:20,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:20,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:20,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:20,748 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:20,748 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,748 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:20,748 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:20,748 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:26:20,748 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:20,748 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:20,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,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:26:20,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:20,802 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:20,802 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:20,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,803 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:26:20,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:20,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:20,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:20,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:20,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:20,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:20,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:20,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:20,819 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:26:20,827 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:20,832 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:20,832 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:20,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:20,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:20,834 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:26:20,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:20,835 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:20,835 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:20,835 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:26:20,838 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:26:20,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-07-22 12:26:20,858 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,902 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,903 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:26:20,903 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:26:20,903 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212 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:26:20,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212. 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 125 states and 341 transitions. Complement of second has 3 states. [2022-07-22 12:26:20,943 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:26:20,943 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:26:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:26:20,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:20,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:20,944 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:20,983 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:20,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:20,983 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:26:20,984 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:26:20,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212 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:26:21,011 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212. 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 125 states and 341 transitions. Complement of second has 3 states. [2022-07-22 12:26:21,011 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:26:21,012 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:26:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:26:21,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:21,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:21,012 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:21,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:21,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:21,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:21,053 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:21,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:21,053 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:26:21,054 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:26:21,054 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212 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:26:21,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212. 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 139 states and 372 transitions. Complement of second has 2 states. [2022-07-22 12:26:21,086 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:26:21,086 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:26:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:26:21,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:26:21,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:21,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:26:21,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:21,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:26:21,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:21,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 372 transitions. [2022-07-22 12:26:21,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-22 12:26:21,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 99 states and 229 transitions. [2022-07-22 12:26:21,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-22 12:26:21,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:26:21,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 229 transitions. [2022-07-22 12:26:21,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:21,092 INFO L220 hiAutomatonCegarLoop]: Abstraction has 99 states and 229 transitions. [2022-07-22 12:26:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 229 transitions. [2022-07-22 12:26:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 70. [2022-07-22 12:26:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.357142857142857) internal successors, (165), 69 states have internal predecessors, (165), 0 states have call successors, (0), 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:26:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 165 transitions. [2022-07-22 12:26:21,096 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 165 transitions. [2022-07-22 12:26:21,097 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 165 transitions. [2022-07-22 12:26:21,097 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 12:26:21,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 165 transitions. [2022-07-22 12:26:21,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:26:21,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:21,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:21,098 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:21,098 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:26:21,099 INFO L748 eck$LassoCheckResult]: Stem: 3618#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3620#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 3644#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 3648#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 3658#[thread2ENTRY, L74-4, thread1ENTRY]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 3660#[L74-4, L56-2, thread1ENTRY]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 3678#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 3722#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 3628#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:21,099 INFO L750 eck$LassoCheckResult]: Loop: 3628#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 3634#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 3628#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash -155212994, now seen corresponding path program 2 times [2022-07-22 12:26:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:21,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767908360] [2022-07-22 12:26:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:21,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:21,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:21,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 10016, now seen corresponding path program 1 times [2022-07-22 12:26:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:21,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588872264] [2022-07-22 12:26:21,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:21,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:21,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:21,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1164177181, now seen corresponding path program 3 times [2022-07-22 12:26:21,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:21,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938583486] [2022-07-22 12:26:21,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:21,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:21,154 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:21,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:21,186 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:21,187 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:21,187 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:21,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:21,187 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:21,187 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,187 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:21,187 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:21,187 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:26:21,187 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:21,188 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:21,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,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:26:21,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:26:21,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,305 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:21,305 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:21,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:21,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:21,318 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:26:21,330 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:26:21,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:21,330 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:21,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:21,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:21,342 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post2=0} Honda state: {thread2Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:21,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:21,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:21,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:21,374 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:26:21,378 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:26:21,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:21,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:21,391 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:21,391 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_23=1} Honda state: {v_rep#funAddr~thread2.offset_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:21,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-22 12:26:21,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:21,413 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:26:21,414 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:26:21,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:21,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:21,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-22 12:26:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:21,444 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:26:21,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:21,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:21,463 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:26:21,506 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:21,509 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:26:21,509 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:21,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:21,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:21,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:21,510 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:21,510 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,510 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:21,510 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:21,510 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:26:21,510 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:21,510 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:21,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,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:26:21,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:21,579 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:21,579 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:21,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:21,581 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:26:21,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:21,591 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:26:21,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:21,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:21,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:21,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:21,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:21,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:21,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:21,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:21,642 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:26:21,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:21,643 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:26:21,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:21,654 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:26:21,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:21,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:21,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:21,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:21,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:21,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:21,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:21,709 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:26:21,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:21,711 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:26:21,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:26:21,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:21,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:21,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:21,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:21,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:21,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:21,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:21,728 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:26:21,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:21,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:21,742 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:21,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:21,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:21,744 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:26:21,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:21,746 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:21,746 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:21,746 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:21,761 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:26:21,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:21,782 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:21,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:21,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:21,823 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:21,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:21,860 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:26:21,861 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:26:21,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 165 transitions. cyclomatic complexity: 116 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:26:21,882 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 165 transitions. cyclomatic complexity: 116. 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 104 states and 248 transitions. Complement of second has 3 states. [2022-07-22 12:26:21,882 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:26:21,883 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:26:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:26:21,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:26:21,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:21,884 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:21,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:21,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:21,919 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:21,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:26:21,936 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:26:21,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 165 transitions. cyclomatic complexity: 116 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:26:21,973 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 165 transitions. cyclomatic complexity: 116. 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 118 states and 284 transitions. Complement of second has 5 states. [2022-07-22 12:26:21,973 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:26:21,974 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:26:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-07-22 12:26:21,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:26:21,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:21,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:26:21,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:21,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:26:21,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:21,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 284 transitions. [2022-07-22 12:26:21,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:26:21,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 106 states and 253 transitions. [2022-07-22 12:26:21,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-07-22 12:26:21,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-07-22 12:26:21,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 253 transitions. [2022-07-22 12:26:21,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:21,979 INFO L220 hiAutomatonCegarLoop]: Abstraction has 106 states and 253 transitions. [2022-07-22 12:26:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 253 transitions. [2022-07-22 12:26:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2022-07-22 12:26:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 2.391304347826087) internal successors, (220), 91 states have internal predecessors, (220), 0 states have call successors, (0), 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:26:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 220 transitions. [2022-07-22 12:26:21,983 INFO L242 hiAutomatonCegarLoop]: Abstraction has 92 states and 220 transitions. [2022-07-22 12:26:21,983 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 220 transitions. [2022-07-22 12:26:21,983 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 12:26:21,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 220 transitions. [2022-07-22 12:26:21,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:26:21,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:21,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:21,985 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:21,985 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:26:21,986 INFO L748 eck$LassoCheckResult]: Stem: 4062#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4064#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 4086#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 4090#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4102#[thread2ENTRY, L74-4, thread1ENTRY]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 4104#[L74-4, L56-2, thread1ENTRY]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4124#[L74-4, L56-2, thread1ENTRY]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 4128#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 4186#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4148#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:21,986 INFO L750 eck$LassoCheckResult]: Loop: 4148#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 4150#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4148#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:21,987 INFO L85 PathProgramCache]: Analyzing trace with hash -515598286, now seen corresponding path program 4 times [2022-07-22 12:26:21,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:21,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662867943] [2022-07-22 12:26:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:21,999 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:22,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash 10016, now seen corresponding path program 2 times [2022-07-22 12:26:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:22,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341566568] [2022-07-22 12:26:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,013 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1568704751, now seen corresponding path program 5 times [2022-07-22 12:26:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:22,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315893341] [2022-07-22 12:26:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:22,052 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:22,053 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:22,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:22,053 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:22,053 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:22,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:22,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:22,053 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:26:22,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:22,053 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:22,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,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:26:22,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:26:22,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,118 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:22,118 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:22,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:22,120 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:26:22,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:22,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:22,141 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:26:22,146 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:22,146 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_25=1} Honda state: {v_rep#funAddr~thread2.offset_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:22,170 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:26:22,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:22,171 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:26:22,172 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:26:22,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:22,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:22,180 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:22,180 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:22,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-22 12:26:22,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:22,202 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:26:22,203 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:26:22,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:22,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:22,244 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:26:22,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:22,245 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:26:22,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:22,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:22,247 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:26:22,285 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:22,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-07-22 12:26:22,288 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:22,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:22,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:22,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:22,289 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:22,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:22,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:22,289 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:26:22,289 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:22,289 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:22,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,362 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:22,362 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:22,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:22,363 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:26:22,364 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:26:22,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:22,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:22,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:22,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:22,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:22,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:22,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:22,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:22,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-07-22 12:26:22,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:22,398 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:26:22,400 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:26:22,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:22,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:22,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:22,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:22,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:22,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:22,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:22,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:22,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:22,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:22,466 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:26:22,467 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:26:22,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:22,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:22,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:22,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:22,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:22,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:22,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:22,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:22,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:22,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:22,480 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:22,481 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:26:22,482 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:26:22,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:22,483 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:22,483 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:22,483 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:22,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:22,505 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:22,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:22,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:22,552 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:22,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:22,573 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:26:22,573 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:26:22,574 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153 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:26:22,594 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153. 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 107 states and 255 transitions. Complement of second has 3 states. [2022-07-22 12:26:22,594 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:26:22,595 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:26:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:26:22,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:26:22,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:22,596 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:22,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:22,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:22,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:22,642 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:22,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:22,658 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:26:22,659 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:26:22,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153 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:26:22,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153. 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 114 states and 276 transitions. Complement of second has 5 states. [2022-07-22 12:26:22,693 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:26:22,693 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:26:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-07-22 12:26:22,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:26:22,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:22,694 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:22,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:22,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:22,733 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:22,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:22,749 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:26:22,750 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:26:22,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153 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:26:22,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153. 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 133 states and 319 transitions. Complement of second has 3 states. [2022-07-22 12:26:22,771 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:26:22,771 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:26:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2022-07-22 12:26:22,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:26:22,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:22,772 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:22,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:22,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:22,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:22,809 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:22,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:22,825 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:26:22,826 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:26:22,826 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153 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:26:22,860 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153. 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 156 states and 403 transitions. Complement of second has 5 states. [2022-07-22 12:26:22,862 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:26:22,863 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:26:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-07-22 12:26:22,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:26:22,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:22,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 12:26:22,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:22,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-22 12:26:22,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:22,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 403 transitions. [2022-07-22 12:26:22,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-22 12:26:22,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 130 states and 313 transitions. [2022-07-22 12:26:22,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-07-22 12:26:22,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-07-22 12:26:22,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 313 transitions. [2022-07-22 12:26:22,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:22,869 INFO L220 hiAutomatonCegarLoop]: Abstraction has 130 states and 313 transitions. [2022-07-22 12:26:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 313 transitions. [2022-07-22 12:26:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 79. [2022-07-22 12:26:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 2.367088607594937) internal successors, (187), 78 states have internal predecessors, (187), 0 states have call successors, (0), 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:26:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 187 transitions. [2022-07-22 12:26:22,874 INFO L242 hiAutomatonCegarLoop]: Abstraction has 79 states and 187 transitions. [2022-07-22 12:26:22,874 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 187 transitions. [2022-07-22 12:26:22,874 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 12:26:22,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 187 transitions. [2022-07-22 12:26:22,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-22 12:26:22,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:22,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:22,875 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:22,875 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1] [2022-07-22 12:26:22,876 INFO L748 eck$LassoCheckResult]: Stem: 4917#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4919#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 4943#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 4947#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4957#[thread2ENTRY, L74-4, thread1ENTRY]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 4959#[L74-4, L56-2, thread1ENTRY]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 4975#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 4997#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 5021#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:22,876 INFO L750 eck$LassoCheckResult]: Loop: 5021#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 5017#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 5013#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 5021#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,877 INFO L85 PathProgramCache]: Analyzing trace with hash -155212994, now seen corresponding path program 6 times [2022-07-22 12:26:22,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:22,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382405725] [2022-07-22 12:26:22,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash 309848, now seen corresponding path program 3 times [2022-07-22 12:26:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:22,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923237332] [2022-07-22 12:26:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1729753595, now seen corresponding path program 7 times [2022-07-22 12:26:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:22,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166940228] [2022-07-22 12:26:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:22,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:22,958 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:22,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:22,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:22,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:22,958 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:22,958 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:22,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:22,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:22,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration14_Loop [2022-07-22 12:26:22,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:22,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:22,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:22,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:26:22,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,022 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:23,023 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:23,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,024 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:26:23,030 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:26:23,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:23,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,044 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:23,044 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_27=1} Honda state: {v_rep#funAddr~thread2.offset_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:23,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:23,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,067 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:26:23,069 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:26:23,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:23,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,083 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:23,083 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_27=-1} Honda state: {v_rep#funAddr~thread2.base_27=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:23,104 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:26:23,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,105 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:26:23,106 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:26:23,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:23,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,114 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:23,114 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:23,135 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:26:23,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,137 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:26:23,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:23,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,155 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:26:23,156 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:23,156 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_27=-1} Honda state: {v_rep#funAddr~thread1.base_27=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:23,179 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:26:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,181 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:26:23,181 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:26:23,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:23,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:23,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,211 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:26:23,212 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:26:23,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:23,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,247 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:23,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-07-22 12:26:23,250 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:23,250 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:23,250 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:23,250 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:23,250 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:23,250 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,250 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:23,250 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:23,250 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration14_Loop [2022-07-22 12:26:23,250 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:23,251 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:23,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,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:26:23,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:26:23,325 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:23,325 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:23,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,327 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:26:23,327 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:26:23,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:23,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:23,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:23,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:23,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:23,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:23,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:23,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:23,361 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:26:23,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,363 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:26:23,363 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:26:23,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:23,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:23,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:23,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:23,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:23,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:23,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:23,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:23,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:23,394 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:26:23,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,395 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:26:23,396 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:26:23,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:26:23,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:23,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:23,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:23,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:23,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:23,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:23,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:23,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:23,432 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:23,432 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:23,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,434 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:26:23,440 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:23,441 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:23,441 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:23,441 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:23,483 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:26:23,486 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:26:23,489 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:23,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:23,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:23,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:23,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:26:23,570 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:26:23,571 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 187 transitions. cyclomatic complexity: 129 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:26:23,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:23,610 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 187 transitions. cyclomatic complexity: 129. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 166 states and 395 transitions. Complement of second has 5 states. [2022-07-22 12:26:23,611 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:26:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:26:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-22 12:26:23,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 3 letters. [2022-07-22 12:26:23,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:23,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2022-07-22 12:26:23,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:23,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 6 letters. [2022-07-22 12:26:23,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:23,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 395 transitions. [2022-07-22 12:26:23,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-22 12:26:23,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 47 states and 103 transitions. [2022-07-22 12:26:23,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 12:26:23,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-22 12:26:23,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 103 transitions. [2022-07-22 12:26:23,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:23,616 INFO L220 hiAutomatonCegarLoop]: Abstraction has 47 states and 103 transitions. [2022-07-22 12:26:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 103 transitions. [2022-07-22 12:26:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-07-22 12:26:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 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:26:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 92 transitions. [2022-07-22 12:26:23,621 INFO L242 hiAutomatonCegarLoop]: Abstraction has 42 states and 92 transitions. [2022-07-22 12:26:23,621 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 92 transitions. [2022-07-22 12:26:23,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 12:26:23,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 92 transitions. [2022-07-22 12:26:23,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-22 12:26:23,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:23,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:23,625 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:26:23,626 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1] [2022-07-22 12:26:23,626 INFO L748 eck$LassoCheckResult]: Stem: 5300#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= v_~Y~0_77 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_77, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5302#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 5322#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 5320#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 5294#[thread2ENTRY, L74-4, thread1ENTRY]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 5296#[L74-4, L56-2, thread1ENTRY]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 5326#[L74-4, L56-2, thread1ENTRY]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 5330#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 5356#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 5340#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:23,626 INFO L750 eck$LassoCheckResult]: Loop: 5340#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 5358#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork1_~x~0_42 10000) (= v_thread1Thread1of1ForFork1_~x~0_41 (+ v_thread1Thread1of1ForFork1_~x~0_42 1))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_42} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 5336#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_42 1) v_thread2Thread1of1ForFork0_~x~1_41) (< v_thread2Thread1of1ForFork0_~x~1_42 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_42} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_41, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 5340#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:26:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash -515598286, now seen corresponding path program 8 times [2022-07-22 12:26:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:23,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47784067] [2022-07-22 12:26:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:23,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:23,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash 309848, now seen corresponding path program 4 times [2022-07-22 12:26:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153333928] [2022-07-22 12:26:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:23,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:23,658 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:26:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:23,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:23,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1385207673, now seen corresponding path program 9 times [2022-07-22 12:26:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:23,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612208456] [2022-07-22 12:26:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:23,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:23,707 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:26:23,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:23,737 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:23,738 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:23,738 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:23,738 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:23,738 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:26:23,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:23,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:23,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration15_Loop [2022-07-22 12:26:23,739 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:23,739 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:23,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,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:26:23,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,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:26:23,808 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:23,809 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:26:23,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,810 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:26:23,811 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:26:23,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:23,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,819 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:26:23,819 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post2=0} Honda state: {thread2Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:26:23,840 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:26:23,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,841 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:26:23,841 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:26:23,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:26:23,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,870 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:26:23,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,871 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:26:23,871 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:26:23,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:26:23,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:26:23,913 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:26:23,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-22 12:26:23,916 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:23,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:23,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:23,916 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:23,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:23,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:23,917 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:23,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration15_Loop [2022-07-22 12:26:23,917 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:23,917 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:23,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,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:26:23,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:23,996 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:23,997 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:23,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:23,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:23,998 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:26:24,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:26:24,006 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:26:24,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:24,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:24,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:24,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:24,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:24,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:24,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:24,015 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:24,016 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:26:24,017 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:26:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:24,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:24,018 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:26:24,018 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:26:24,018 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:24,019 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:26:24,019 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:24,019 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:26:24,040 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:26:24,040 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:26:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:24,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:24,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:24,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:24,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:26:24,110 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:26:24,110 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 92 transitions. cyclomatic complexity: 59 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:26:24,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 92 transitions. cyclomatic complexity: 59. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 52 states and 113 transitions. Complement of second has 5 states. [2022-07-22 12:26:24,129 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:26:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:26:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-07-22 12:26:24,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-22 12:26:24,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:24,130 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:24,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:24,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:24,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:24,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:24,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:26:24,188 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:26:24,188 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 92 transitions. cyclomatic complexity: 59 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:26:24,205 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 92 transitions. cyclomatic complexity: 59. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 52 states and 113 transitions. Complement of second has 5 states. [2022-07-22 12:26:24,206 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:26:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:26:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-07-22 12:26:24,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-22 12:26:24,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:24,207 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:26:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:24,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:24,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:24,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:24,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:26:24,278 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 3 loop predicates [2022-07-22 12:26:24,278 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 92 transitions. cyclomatic complexity: 59 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:26:24,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 92 transitions. cyclomatic complexity: 59. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 93 states and 198 transitions. Complement of second has 7 states. [2022-07-22 12:26:24,302 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:26:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:26:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-07-22 12:26:24,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-22 12:26:24,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:24,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-22 12:26:24,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:24,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-22 12:26:24,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:24,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 198 transitions. [2022-07-22 12:26:24,305 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:26:24,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 0 states and 0 transitions. [2022-07-22 12:26:24,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 12:26:24,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 12:26:24,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 12:26:24,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:24,306 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:26:24,306 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:26:24,306 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:26:24,306 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 12:26:24,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 12:26:24,306 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:26:24,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 12:26:24,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:26:24 BoogieIcfgContainer [2022-07-22 12:26:24,314 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:26:24,314 INFO L158 Benchmark]: Toolchain (without parser) took 17469.82ms. Allocated memory was 151.0MB in the beginning and 238.0MB in the end (delta: 87.0MB). Free memory was 125.6MB in the beginning and 144.5MB in the end (delta: -18.9MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. [2022-07-22 12:26:24,315 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:26:24,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.41ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 114.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:26:24,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.05ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 113.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:26:24,316 INFO L158 Benchmark]: Boogie Preprocessor took 26.96ms. Allocated memory is still 151.0MB. Free memory was 113.0MB in the beginning and 112.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:26:24,316 INFO L158 Benchmark]: RCFGBuilder took 507.27ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 100.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:26:24,316 INFO L158 Benchmark]: BuchiAutomizer took 16617.00ms. Allocated memory was 151.0MB in the beginning and 238.0MB in the end (delta: 87.0MB). Free memory was 100.2MB in the beginning and 144.5MB in the end (delta: -44.4MB). Peak memory consumption was 43.6MB. Max. memory is 8.0GB. [2022-07-22 12:26:24,318 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 151.0MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.41ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 114.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.05ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 113.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.96ms. Allocated memory is still 151.0MB. Free memory was 113.0MB in the beginning and 112.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 507.27ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 100.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 16617.00ms. Allocated memory was 151.0MB in the beginning and 238.0MB in the end (delta: 87.0MB). Free memory was 100.2MB in the beginning and 144.5MB in the end (delta: -44.4MB). Peak memory consumption was 43.6MB. 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 17 terminating modules (2 trivial, 11 deterministic, 4 nondeterministic). One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 3 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 3 locations. One nondeterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One nondeterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One nondeterministic module has affine ranking function 19999 + x * -2 and consists of 3 locations. One nondeterministic module has affine ranking function 19999 + x * -2 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.3s and 16 iterations. TraceHistogramMax:2. Analysis of lassos took 10.5s. Construction of modules took 0.5s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 17. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 279 StatesRemovedByMinimization, 15 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 [10, 1, 3, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 274 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 742 IncrementalHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 0 mSDtfsCounter, 742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT13 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax310 hnf100 lsp28 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 41 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 15 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.2s InitialAbstractionConstructionTime: 2.9s - 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: 2.8s, 84 PlacesBefore, 20 PlacesAfterwards, 83 TransitionsBefore, 15 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 82 TotalNumberOfCompositions, 496 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 496, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 360, positive: 360, positive conditional: 0, positive unconditional: 360, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 360, positive: 356, positive conditional: 0, positive unconditional: 356, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 496, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 360, unknown conditional: 0, unknown unconditional: 360] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2022-07-22 12:26:24,358 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:26:24,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...